753 search results - page 11 / 151 » Completing a (k - 1)-Assignment |
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
114
click to vote
SIAMJO
2010
14 years 8 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
RSA
2006
14 years 9 months ago
2006
In this note we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on recent results of Nagle, Schacht and the authors, we...
ASSETS
2006
ACM
15 years 3 months ago
2006
ACM
We present a major extension to our previous work on Trackball EdgeWrite—a unistroke text entry method for trackballs—by taking it from a character-level technique to a word-l...
JMLR
2012
13 years 5 days ago
2012
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...