607 search results - page 18 / 122 » Unifying Exact Completions |
105
click to vote
COLOGNETWENTE
2010
14 years 7 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
ICSE
2009
IEEE-ACM
15 years 5 months ago
2009
IEEE-ACM
Model-Driven Engineering (MDE) has become an important development framework for many large-scale software. Previous research has reported that as in traditional code-based develo...
123
click to vote
SCALESPACE
2009
Springer
15 years 5 months ago
2009
Springer
From an image we construct an invertible orientation score, which provides an overview of local orientations in an image. This orientation score is a function on the group SE(2) of...
108
click to vote
TIT
2010
14 years 5 months ago
2010
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
121
click to vote
COCOON
2009
Springer
15 years 5 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...