147 search results - page 25 / 30 » Cycle decompositions of the complete graph |
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multidimensional boolean selections. Typical preference queries includes...
AAAI
2008
13 years 10 months ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
While global methods for matching shapes to images have recently been proposed, so far research has focused on small deformations of a fixed template. In this paper we present the...
SOFSEM
2010
Springer
14 years 2 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
AAAI
2006
13 years 9 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...