Sciweavers

11394 search results - page 2117 / 2279
» Error-Correcting Data Structures
Sort
View
MCS
2007
Springer
15 years 9 months ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
CCECE
2006
IEEE
15 years 9 months ago
Survey of Biological High Performance Computing: Algorithms, Implementations and Outlook Research
During recent years there has been an explosive growth of biological data coming from genome projects, proteomics, protein structure determination, and the rapid expansion in digi...
Nasreddine Hireche, J. M. Pierre Langlois, Gabriel...
97
Voted
CGO
2006
IEEE
15 years 9 months ago
Compiling for EDGE Architectures
Explicit Data Graph Execution (EDGE) architectures offer the possibility of high instruction-level parallelism with energy efficiency. In EDGE architectures, the compiler breaks ...
Aaron Smith, Jon Gibson, Bertrand A. Maher, Nichol...
134
Voted
IJCNN
2006
IEEE
15 years 9 months ago
Biologically Inspired KFLANN Place Fields for Robot Localization
– This paper presents a hippocampal inspired robot localization model that provides a means for a simple robotic platform with ultrasonic sensors to localize itself. There have b...
Alex Leng Phuan Tay
156
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
« Prev « First page 2117 / 2279 Last » Next »