Sciweavers

316 search results - page 33 / 64
» Metric embedding of view-graphs
Sort
View
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
13 years 9 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
NIPS
1997
13 years 9 months ago
Mapping a Manifold of Perceptual Observations
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
Joshua B. Tenenbaum
DATE
2002
IEEE
97views Hardware» more  DATE 2002»
14 years 15 days ago
Analog IP Testing: Diagnosis and Optimization
In this paper, we present an innovative methodology to estimate and improve the quality of analog and mixed-signal circuit testing. We first detect and reduce the redundancy in th...
Carlo Guardiani, Patrick McNamara, Lidia Daldoss, ...
RTAS
2010
IEEE
13 years 6 months ago
Multi-Application Deployment in Shared Sensor Networks Based on Quality of Monitoring
Abstract—Wireless sensor networks are evolving from dedicated application-specific platforms to integrated infrastructure shared by multiple applications. Shared sensor networks...
Sangeeta Bhattacharya, Abusayeed Saifullah, Chenya...
WG
2010
Springer
13 years 5 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...