5595 search results - page 916 / 1119 » Approximation Algorithms for Clustering Problems |
187
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
258
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
152
click to vote
MSWIM
2005
ACM
15 years 12 months ago
2005
ACM
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication ...
197
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
257
click to vote
GIS
2008
ACM
16 years 7 months ago
2008
ACM
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...