360 search results - page 15 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
181
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
167
click to vote
GIS
2005
ACM
15 years 10 months ago
2005
ACM
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
129
click to vote
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
We consider a mobile sensor network monitoring a spatio-temporal field. Given limited caches at the sensor nodes, the goal is to develop a distributed cache management algorithm to...
HPDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Current projects that automate the collection of provenance information use a centralized architecture for managing the resulting metadata - that is, provenance is gathered at rem...
COMPGEOM
2004
ACM
15 years 2 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...