4114 search results - page 598 / 823 » Efficient Algorithms for the 2-Center Problems |
152
click to vote
IVS
2007
15 years 5 months ago
2007
This paper describes a fast approach to automatic point label de-confliction on interactive maps. The general Map Labeling problem is NP-hard and has been the subject of much stud...
173
click to vote
TKDE
2008
15 years 5 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
136
click to vote
ALGORITHMICA
2000
15 years 5 months ago
2000
Abstract. We consider the problem of planning sensor control strategies that enable a sensor to be automatically configured for robot tasks. In this paper we present robust and eff...
264
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
223
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...