179 search results - page 23 / 36 » On Approximating the Average Distance Between Points |
CEC
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
KDD
2006
ACM
16 years 3 days ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
117
click to vote
PODS
2004
ACM
15 years 11 months ago
2004
ACM
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
CIVR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We introduce a view–point invariant representation of moving object trajectories that can be used in video database applications. It is assumed that trajectories lie on...
110
click to vote
STACS
2007
Springer
15 years 5 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...