Sciweavers

2944 search results - page 67 / 589
» Improving Bound Propagation
Sort
View
PLDI
2010
ACM
14 years 7 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
CVPR
2000
IEEE
14 years 1 months ago
Likelihood Functions and Confidence Bounds for Total-Least-Squares Problems
This paper addresses the derivation of likelihood functions and confidence bounds for problems involving overdetermined linear systems with noise in all measurements, often referr...
Oscar Nestares, David J. Fleet, David J. Heeger
ICASSP
2008
IEEE
14 years 4 months ago
Mode sign estimation to improve source depth estimation
This paper describes source depth estimation in shallow water environments using a Horizontal Line Array of hydrophones on the sea bottom. A method based on modal propagation, usi...
Barbara Nicolas, Grégoire Le Touzé, ...
ISIPTA
2003
IEEE
130views Mathematics» more  ISIPTA 2003»
14 years 3 months ago
Some Results on Generalized Coherence of Conditional Probability Bounds
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo
IJCAI
2007
13 years 11 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings