Sciweavers

97 search results - page 8 / 20
» Approximate center points with proofs
Sort
View
PAMI
2011
13 years 2 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
FOCS
1998
IEEE
13 years 12 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Daniele Micciancio
ACIVS
2006
Springer
14 years 1 months ago
Visibility of Point Clouds and Mapping of Unknown Environments
Abstract. We present an algorithm for interpolating the visible portions of a point cloud that are sampled from opaque objects in the environment. Our algorithm projects point clou...
Yanina Landa, Richard Tsai, Li-Tien Cheng
JMIV
2006
185views more  JMIV 2006»
13 years 7 months ago
Intrinsic Statistics on Riemannian Manifolds: Basic Tools for Geometric Measurements
In medical image analysis and high level computer vision, there is an intensive use of geometric features like orientations, lines, and geometric transformations ranging from simp...
Xavier Pennec
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
13 years 11 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...