234 search results - page 25 / 47 » On the relative complexity of approximate counting problems |
SIGPRO
2010
14 years 8 months ago
2010
The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
110
click to vote
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
109
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
108
click to vote
ECRTS
2009
IEEE
14 years 7 months ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...