209 search results - page 15 / 42 » t-Spanners for metric space searching |
101
click to vote
SISAP
2010
IEEE
15 years 2 days ago
2010
IEEE
The efficient similarity search in metric spaces is usually based on several low-level partitioning principles, which allow filtering of non-relevant objects during the search. I...
105
click to vote
AAAI
1998
15 years 3 months ago
1998
The problem of concurrent mapping and localization has received considerable attention in the mobile robotics community. Existing approachescan largely be grouped into two distinc...
AIPS
2006
15 years 3 months ago
2006
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
101
Voted
JEA
2008
15 years 1 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
132
click to vote
FOCS
2009
IEEE
15 years 5 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...