4541 search results - page 313 / 909 » Cache-Oblivious Algorithms and Data Structures |
260
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
141
click to vote
ICNP
2005
IEEE
15 years 9 months ago
2005
IEEE
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
140
click to vote
UAI
1997
15 years 5 months ago
1997
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
133
click to vote
HPCC
2010
Springer
15 years 5 months ago
2010
Springer
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
120
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...