5138 search results - page 118 / 1028 » Randomized Algorithms for 3-SAT |
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Given an order-d tensor A Rn
116
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
Abstract—Traffic monitoring and estimation of flow parameters in high speed routers have recently become challenging as the Internet grew in both scale and complexity. In this ...
111
click to vote
COCO
2003
Springer
15 years 7 months ago
2003
Springer
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
106
click to vote
COLT
2003
Springer
15 years 7 months ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Given d (0, ) let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n, d/n) is either kd or kd + 1 almost surely.