搜索结果
找到约 336 项符合
Structure 的查询结果
按分类筛选
- 全部分类
- 技术资料 (117)
- matlab例程 (19)
- 数据结构 (17)
- 单片机编程 (14)
- 其他书籍 (14)
- 其他 (12)
- 文章/文档 (11)
- 软件设计/软件工程 (9)
- 书籍 (8)
- Java编程 (8)
- 人工智能/神经网络 (7)
- 电子书籍 (6)
- 汇编语言 (6)
- 压缩解压 (4)
- 文件格式 (4)
- VHDL/FPGA/Verilog (4)
- SQL Server (4)
- 通信网络 (3)
- 网络 (3)
- 其他数据库 (3)
- 单片机开发 (3)
- 系统设计方案 (3)
- GPS编程 (3)
- 源码 (2)
- DSP编程 (2)
- 数值算法/人工智能 (2)
- 技术书籍 (2)
- Linux/Unix编程 (2)
- 编译器/解释器 (2)
- 技术管理 (2)
- USB编程 (2)
- 通讯编程文档 (2)
- 其他行业 (2)
- VIP专区 (2)
- 论文 (1)
- PCB相关 (1)
- 电源技术 (1)
- 无线通信 (1)
- Linux/uClinux/Unix编程 (1)
- 多媒体处理 (1)
- 数据库系统 (1)
- 通讯/手机编程 (1)
- 书籍源码 (1)
- 其他文档 (1)
- 软件工程 (1)
- 模拟电子 (1)
- 可编程逻辑 (1)
- 驱动编程 (1)
- Internet/网络编程 (1)
- 语音压缩 (1)
- 磁盘编程 (1)
- 企业管理 (1)
- 传真(Fax)编程 (1)
- 金融证券系统 (1)
- 嵌入式/单片机编程 (1)
- uCOS (1)
- 嵌入式Linux (1)
- Java书籍 (1)
- J2ME (1)
- 家庭/个人应用 (1)
- 生物技术 (1)
- Symbian (1)
- 其他嵌入式/单片机内容 (1)
- MySQL数据库 (1)
- 邮电通讯系统 (1)
- Ajax (1)
网络 penMesh is a generic and efficient data structure for representing and manipulating polygonal meshes
penMesh is a generic and efficient data structure for representing and manipulating polygonal meshes. OpenMesh is developed at the Computer Graphics Group, RWTH Aachen , as part of the OpenSGPlus project, is funded by the German Ministry for Research and Education ( BMBF), and will serve as geometry ...
数据结构 This is an implementation of double-array structure for representing trie, as proposed by Junichi A
This is an implementation of double-array structure for representing trie,
as proposed by Junichi Aoe [1].
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental m ...
Ajax XML parser with DOM. Helps on parsing and generating a directory structure
XML parser with DOM. Helps on parsing and generating a directory structure
数据结构 Libgist is an implementation of the Generalized Search Tree, a template index structure that makes i
Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).
压缩解压 Structure the sources so that the compression and decompression code form a library usable by any
Structure the sources so that the compression and decompression code
form a library usable by any program, and write both gzip and zip on
top of this library. This would ideally be a reentrant (thread safe)
library, but this would degrade performance. In the meantime, you can
look at the sample ...
软件设计/软件工程 It s a note on data structure---AVL tree, very clear and useful!
It s a note on data structure---AVL tree, very clear and useful!
通讯编程文档 In addition to individual algorithm, Demonstration System is a "data structure" (C language version)
In addition to individual algorithm, Demonstration System is a "data structure" (C language version) book algorithm corresponding to the code (CPP) and the test operating procedures (VC + +6.0 to the EXE). Through the system can demonstrate that the algorithm source code and operating results
其他行业 All are the assignments of mine that I have developped in Data Structure Laboratory Hours
All are the assignments of mine that I have developped in Data Structure Laboratory Hours
文章/文档 30 projet de pic basic programme et structure du circuit
30 projet de pic basic programme et structure du circuit
数据结构 SR-tree is an index structure for high-dimensional nearest neighbor queries
SR-tree is an index structure for high-dimensional nearest neighbor queries,C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video applications.