Sciweavers

3820 search results - page 131 / 764
» Bounded Model Debugging
Sort
View
139
Voted
AAAI
2006
15 years 4 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
78
Voted
CORR
2010
Springer
47views Education» more  CORR 2010»
15 years 2 months ago
Lower bounds for the error decay incurred by coarse quantization schemes
Several analog-to-digital conversion methods for bandlimited signals used in applications, such as quantization schemes, employ coarse quantization coupled with oversampling. The...
Felix Krahmer, Rachel Ward
123
Voted
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 2 months ago
Lower bounds for distributed markov chain problems
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...
Rahul Sami, Andy Twigg
104
Voted
TIT
2011
119views more  TIT 2011»
14 years 9 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
130
Voted
ICPR
2008
IEEE
16 years 3 months ago
On using error bounds to optimize cost-sensitive multimodal biometric authentication
While using more biometric traits in multimodal biometric fusion can effectively increase the system robustness, often, the cost associated to adding additional systems is not con...
Norman Poh, Josef Kittler