451 search results - page 37 / 91 » Some Lower Bounds on Geometric Separability Problems |
59
Voted
IPL
2008
14 years 9 months ago
2008
We define and solve a simple extension of the ski-rental problem [4]. In the classical version, the algorithm needs to decide when to switch from renting to buying. In our version...
JMMA
2002
14 years 9 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
84
Voted
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
NIPS
2001
14 years 11 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...