59 search results - page 7 / 12 » soda 2003 |
SODA
2003
ACM
14 years 11 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
What will it be like to work in the digital library of the future? We begin by browsing around an experimental digital library of the present, glancing at some collections and show...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...