1101 search results - page 172 / 221 » An Algorithm for the Graph Crossing Number Problem |
106
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
121
click to vote
SODA
1992
ACM
15 years 3 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
111
click to vote
SYNASC
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
122
click to vote
COLT
1993
Springer
15 years 6 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
107
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We present a practical framework for detecting and modeling 3D static occlusions for wide-baseline, multi-camera scenarios where the number of cameras is small. The framework cons...