2168 search results - page 95 / 434 » Randomized Algorithms and Complexity Theory |
123
click to vote
TON
2002
15 years 2 months ago
2002
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
139
click to vote
FCT
2007
Springer
15 years 9 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
124
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
105
click to vote
IJCV
2000
15 years 2 months ago
2000
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
133
click to vote
ICANN
2010
Springer
15 years 3 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...