4886 search results - page 205 / 978 » Approximate Data Exchange |
221
click to vote
ESA
2007
Springer
16 years 17 days ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
196
click to vote
ISAAC
2007
Springer
16 years 16 days ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
153
click to vote
SPIRE
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
168
click to vote
FC
2005
Springer
15 years 12 months ago
2005
Springer
Approximate Message Authentication Code (AMAC) is a recently introduced cryptographic primitive with several applications in the areas of cryptography and coding theory. Briefly s...
181
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...