60 search results - page 1 / 12 » Dispersion of Mass and the Complexity of Randomized Geometri... |
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
JMIV
2006
13 years 4 months ago
2006
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...
COCO
2001
Springer
13 years 9 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
COMPGEOM
1998
ACM
13 years 8 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...