2292 search results - page 187 / 459 » Hierarchical approximation and localization |
205
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
202
click to vote
COMPGEOM
2004
ACM
15 years 12 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...
169
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
198
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
203
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...