430 search results - page 13 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
119
click to vote
DASFAA
2004
IEEE
15 years 4 months ago
2004
IEEE
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
120
Voted
MVA
2007
15 years 2 months ago
2007
In this paper a new approach to finding and tracking various land cover boundaries such as rivers, agricultural fields, channels and roads for use in visual navigation system of a...
115
Voted
FOCS
2008
IEEE
15 years 1 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
104
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
98
Voted
CSR
2008
Springer
15 years 2 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...