58 search results - page 8 / 12 » Subexponential Algorithms for Partial Cover Problems |
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
CIKM
2009
Springer
14 years 11 days ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
ICGI
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...