Sciweavers

11213 search results - page 2110 / 2243
» Low-contention data structures
Sort
View
CCECE
2006
IEEE
14 years 4 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...
CGO
2006
IEEE
14 years 4 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...
IJCNN
2006
IEEE
14 years 4 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
INFOCOM
2006
IEEE
14 years 4 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
SSDBM
2006
IEEE
163views Database» more  SSDBM 2006»
14 years 4 months ago
ACache: Using Caching to Improve the Performance of Multiple Sequence Alignments
Multiple sequence alignment represents a class of powerful bioinformatics tools with many uses in computational biology ranging from discovery of characteristic motifs and conserv...
Xun Tu, Kajal T. Claypool, Cindy X. Chen
« Prev « First page 2110 / 2243 Last » Next »