451 search results - page 23 / 91 » Some Lower Bounds on Geometric Separability Problems |
65
Voted
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
64
Voted
COLT
2008
Springer
14 years 11 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
92
Voted
ICALP
1992
Springer
15 years 1 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...