1091 search results - page 113 / 219 » Approximation Algorithms for Data Placement Problems |
SMI
2006
IEEE
14 years 1 months ago
2006
IEEE
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
MLDM
2008
Springer
13 years 7 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
STACS
2007
Springer
14 years 2 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...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...