234 search results - page 24 / 47 » On the relative complexity of approximate counting problems |
101
click to vote
ECML
1993
Springer
15 years 5 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
114
click to vote
ESA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
117
click to vote
CSL
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
113
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
129
click to vote
APPROX
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...