451 search results - page 8 / 91 » Some Lower Bounds on Geometric Separability Problems |
CSR
2008
Springer
14 years 11 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
105
Voted
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
CCCG
2006
14 years 11 months ago
2006
We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....