4560 search results - page 535 / 912 » Finding Data in the Neighborhood |
174
Voted
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
168
click to vote
SIGIR
1992
ACM
15 years 11 months ago
1992
ACM
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
147
click to vote
SIGMETRICS
1990
ACM
15 years 11 months ago
1990
ACM
Recently we presented several disk array architectures designed to increase the data rate and I/O rate of supercomputing applications, transaction processing, and file systems [Pat...
200
click to vote
VLDB
1990
ACM
15 years 11 months ago
1990
ACM
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
197
click to vote
AUTONOMICS
2007
ACM
15 years 11 months ago
2007
ACM
A good understanding of contact patterns in delay tolerant networks (DTNs) is essential for the design of effective routing schemes. Prior work has typically focused on intercontac...