Sciweavers

736 search results - page 107 / 148
» A dynamic data structure for approximate range searching
Sort
View
WOWMOM
2005
ACM
240views Multimedia» more  WOWMOM 2005»
14 years 2 months ago
An Adaptive Routing Protocol for Ad Hoc Peer-to-Peer Networks
Ad hoc networks represent a key factor in the evolution of wireless communications. These networks typically consist of equal nodes that communicate without central control, inter...
Luca Gatani, Giuseppe Lo Re, Salvatore Gaglio
IPMI
2007
Springer
14 years 9 months ago
Shape Modeling and Analysis with Entropy-Based Particle Systems
This paper presents a new method for constructing compact statistical point-based models of ensembles of similar shapes that does not rely on any specific surface parameterization....
Joshua E. Cates, P. Thomas Fletcher, Martin Andrea...
JDA
2008
87views more  JDA 2008»
13 years 8 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
ICDE
2005
IEEE
185views Database» more  ICDE 2005»
14 years 10 months ago
A Multiresolution Symbolic Representation of Time Series
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
Vasileios Megalooikonomou, Qiang Wang, Guo Li, Chr...
FOCS
2000
IEEE
14 years 1 months ago
Cache-Oblivious B-Trees
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
Michael A. Bender, Erik D. Demaine, Martin Farach-...