227 search results - page 24 / 46 » Weighted Coloring: Further Complexity and Approximability Re... |
ALGORITHMICA
2010
13 years 7 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
FGR
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper proposes a method of determining human head poses from a sequence of images. The main idea is to use some features in a 3D head model to generate a virtual fronto-paral...
CIA
2006
Springer
13 years 11 months ago
2006
Springer
In multi-issue negotiations, issues may be negotiated independently or not. In the latter case, the utility associated with one issue depends on the value of another. These issue d...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
SLP
1994
13 years 9 months ago
1994
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...