1449 search results - page 248 / 290 » Self-Randomized Exponentiation Algorithms |
109
Voted
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
A q-ary error-correcting code C ⊆ {1, 2, . . . , q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords o...
137
Voted
DAC
2004
ACM
15 years 8 months ago
2004
ACM
—This paper proposes a novel approach to the exact symbolic analysis of very large analog circuits. The new method is based on determinant decision diagrams (DDDs) representing s...
120
Voted
SIGCOMM
2004
ACM
15 years 8 months ago
2004
ACM
Recent research efforts to design better Internet transport protocols combined with scalable Active Queue Management (AQM) have led to significant advances in congestion control...
113
Voted
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
108
Voted
COLT
2004
Springer
15 years 8 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....