217 search results - page 35 / 44 » Searching in metric spaces with user-defined and approximate... |
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
We study in this paper the problem of bridging the semantic gap between low-level image features and high-level semantic concepts, which is the key hindrance in content-based imag...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
SIGMOD
2010
ACM
14 years 13 days ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...