Sciweavers

SIGMETRICS
2006
ACM
114views Hardware» more  SIGMETRICS 2006»
13 years 11 months ago
On suitability of Euclidean embedding of internet hosts
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
Sanghwan Lee, Zhi-Li Zhang, Sambit Sahu, Debanjan ...
FOCS
2006
IEEE
13 years 11 months ago
Points on Computable Curves
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
ICASSP
2007
IEEE
13 years 11 months ago
Breaking the Limitation of Manifold Analysis for Super-Resolution of Facial Images
A novel method for robust super-resolution offace images is proposed in this paper. Face super-resolution is a particular interest in video surveillance where face images have typ...
Sung Won Park, Marios Savvides
ISVD
2007
IEEE
13 years 11 months ago
From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a fi...
Károly Bezdek
PODS
2001
ACM
120views Database» more  PODS 2001»
14 years 5 months ago
Database-friendly random projections
A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space -- where k is lo...
Dimitris Achlioptas
CVPR
1998
IEEE
14 years 7 months ago
Clustering Appearances of 3D Objects
We introduce a method for unsupervised clustering of images of 3D objects. Our method examines the space of all images and partitions the images into sets that form smooth and par...
Ronen Basri, Dan Roth, David W. Jacobs