3991 search results - page 150 / 799 » Bounding homogeneous models |
ICALP
1992
Springer
14 years 6 days ago
1992
Springer
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
NIPS
2008
13 years 9 months ago
2008
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
AAAI
2006
13 years 9 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Several analog-to-digital conversion methods for bandlimited signals used in applications, such as quantization schemes, employ coarse quantization coupled with oversampling. The...
CORR
2008
Springer
13 years 8 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...