1433 search results - page 251 / 287 » On Covering Problems of Rado |
104
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
104
click to vote
COLT
1993
Springer
15 years 3 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
102
click to vote
COMPGEOM
1994
ACM
15 years 3 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
COCO
2010
Springer
15 years 3 months ago
2010
Springer
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
110
click to vote
SPW
2000
Springer
15 years 3 months ago
2000
Springer
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...