55 search results - page 8 / 11 » Bounds on pseudoexhaustive test lengths |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
JCSS
2010
13 years 5 months ago
2010
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
CLEAR
2007
Springer
14 years 1 months ago
2007
Springer
This paper presents the algorithm and evaluation results of a face detection and tracking system. A tree-structured multi-view face detector trained by Vector Boosting is used as t...
FCT
2005
Springer
14 years 28 days ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...