3820 search results - page 126 / 764 » Bounded Model Debugging |
106
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
109
click to vote
ICMCS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we study the problem of the fast selection of video objects, as an aid for the efficient semi-automatic annotation of video programs. In a regular system, the user ...
119
Voted
ESA
1999
Springer
15 years 6 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
151
click to vote
NIPS
2000
15 years 3 months ago
2000
Jensen's inequality is a powerful mathematical tool and one of the workhorses in statistical learning. Its applications therein include the EM algorithm, Bayesian estimation ...
123
Voted
SPIRE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...