Sciweavers

34 search results - page 5 / 7
» Linear-Space Algorithms for Distance Preserving Embedding
Sort
View
CVPR
2001
IEEE
14 years 10 months ago
Bending Invariant Representations for Surfaces
Isometric surfaces share the same geometric structure also known as the `first fundamental form'. For example, all possible bending of a given surface, that include all lengt...
Asi Elad (Elbaz), Ron Kimmel
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 8 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
ICIP
2009
IEEE
13 years 6 months ago
Highly-parallelized motion estimation for Scalable Video Coding
In this paper, we discuss the design of a highly-parallel motion estimator for real-time Scalable Video Coding (SVC). In an SVC, motion is commonly estimated bidirectionally and o...
Marijn J. H. Loomans, Cornelis J. Koeleman, Peter ...
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
14 years 10 days ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
STACS
2007
Springer
14 years 2 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
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...
Artur Czumaj, Christian Sohler