876 search results - page 26 / 176 » Complexity in geometric SINR |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
The medial axis of a shape is known to carry a lot of information about it. In particular a recent result of Lieutier establishes that every bounded open subset of Rn has the same...
COLT
2000
Springer
13 years 12 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
VIS
2007
IEEE
14 years 8 months ago
2007
IEEE
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
JCT
2006
13 years 7 months ago
2006
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...