Sciweavers

1274 search results - page 205 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
FOCS
1998
IEEE
14 years 2 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
SPAA
1990
ACM
14 years 2 months ago
Parallel Algorithms for Arrangements
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
Richard J. Anderson, Paul Beame, Erik Brisson
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 10 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
CVPR
2000
IEEE
14 years 12 months ago
On the Number of Samples Needed in Light Field Rendering with Constant-Depth Assumption
While several image-based rendering techniques have been proposed to successfully render scenes/objects from a large collection (e.g., thousands) of images without explicitly reco...
Zhouchen Lin, Heung-Yeung Shum
CVPR
2007
IEEE
14 years 12 months ago
Seamless Mosaicing of Image-Based Texture Maps
Image-based object modeling has emerged as an important computer vision application. Typically, the process starts with the acquisition of the image views of an object. These view...
Victor S. Lempitsky, Denis V. Ivanov