Sciweavers

4255 search results - page 69 / 851
» Cover
Sort
View
IJCGA
1998
74views more  IJCGA 1998»
14 years 11 months ago
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukaw...
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 10 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
CORR
2010
Springer
158views Education» more  CORR 2010»
14 years 8 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel
SOICT
2010
14 years 6 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
16 years 5 days ago
Terminal backup, 3D matching, and covering cubic graphs
Elliot Anshelevich, Adriana Karagiozova