753 search results - page 20 / 151 » Completing a (k - 1)-Assignment |
123
click to vote
JCT
2010
15 years 11 days ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
108
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
106
click to vote
MICS
2010
15 years 10 days ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
131
click to vote
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
We present a variational approach to the problem of registering planar shapes despite missing parts. Registration is achieved through the evolution of a partial differential equat...
115
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...