13603 search results - page 266 / 2721 » On the Complexity of Computing Treelength |
195
click to vote
COMPGEOM
2008
ACM
15 years 7 months ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
162
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
147
click to vote
CHI
2008
ACM
16 years 6 months ago
2008
ACM
Coarse-grained approaches to customization allow the user to enable or disable groups of features at once, rather than individual features. While this may reduce the complexity of...
134
click to vote
STACS
2010
Springer
16 years 29 days ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
157
click to vote
FOCS
2009
IEEE
16 years 22 days ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...