728 search results - page 108 / 146 » Compressing combinatorial objects |
233
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
113
click to vote
EUROGRAPHICS
2010
Eurographics
15 years 11 months ago
2010
Eurographics
We present an automatic method to recover high-resolution texture over an object by mapping detailed photographs onto its surface. Such high-resolution detail often reveals inaccu...
120
click to vote
ICRA
2009
IEEE
15 years 9 months ago
2009
IEEE
— In this paper, we propose a method that detects repeated motion patterns in a long motion sequence efficiently. Repeated motion patterns are the structured information that ca...
136
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
102
click to vote
ISSAC
2009
Springer
15 years 8 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...