Sciweavers

11231 search results - page 2090 / 2247
» Digging for Data Structures
Sort
View
IJCNN
2006
IEEE
15 years 5 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
15 years 5 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»
15 years 5 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
CASES
2006
ACM
15 years 5 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
EXPDB
2006
ACM
15 years 5 months ago
Pushing XPath Accelerator to its Limits
Two competing encoding concepts are known to scale well with growing amounts of XML data: XPath Accelerator encoding implemented by MonetDB for in-memory documents and X-Hive’s ...
Christian Grün, Alexander Holupirek, Marc Kra...
« Prev « First page 2090 / 2247 Last » Next »