426 search results - page 42 / 86 » Run lengths and liquidity |
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
CC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
CC
2008
Springer
13 years 10 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
ENTCS
2006
13 years 10 months ago
2006
In addition to efficient code generation, causality cycles and schizophrenic statements are major problems for the compilation of synchronous programs. Although these problems are ...