Sciweavers

181 search results - page 16 / 37
» On Quantification with A Finite Universe
Sort
View
CORR
2007
Springer
162views Education» more  CORR 2007»
13 years 7 months ago
Order-Invariant MSO is Stronger than Counting MSO in the Finite
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
Tobias Ganzow, Sasha Rubin
ICCV
1999
IEEE
14 years 9 months ago
United Snakes
Since their debut in 1987, snakes (active contour models) have become a standard image analysis technique with several variants now in common use. We present a framework called ``...
Jianming Liang, Tim McInerney, Demetri Terzopoulos
DSD
2006
IEEE
113views Hardware» more  DSD 2006»
13 years 9 months ago
Cascade Scheme for Concurrent Errors Detection
The paper deals with synthesis technique for designing circuits with cascade errors detection. The proposed technique is based on partitioning a scheme into a number of cascades f...
Ilya Levin, Vladimir Ostrovsky, Osnat Keren, Vladi...
ICTAC
2009
Springer
13 years 5 months ago
A First-Order Policy Language for History-Based Transaction Monitoring
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
Andreas Bauer 0002, Rajeev Goré, Alwen Tiu
DAGSTUHL
2006
13 years 9 months ago
Complexity Monotone in Conditions and Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true dis...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...