Sciweavers

548 search results - page 9 / 110
» Global value numbering using random interpretation
Sort
View
CAV
2001
Springer
154views Hardware» more  CAV 2001»
15 years 1 months ago
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
ICCV
2005
IEEE
15 years 11 months ago
Globally Optimal Solutions for Energy Minimization in Stereo Vision Using Reweighted Belief Propagation
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
Talya Meltzer, Chen Yanover, Yair Weiss
AAAI
2006
14 years 11 months ago
An Efficient Way of Breaking Value Symmetries
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
Jean-François Puget
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 2 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
DAGSTUHL
2004
14 years 11 months ago
Optimal algorithms for global optimization in case of unknown Lipschitz constant
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
Matthias U. Horn