Sciweavers

607 search results - page 2 / 122
» Unifying Exact Completions
Sort
View
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 6 months ago
Exact Matrix Completion via Convex Optimization
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at ran...
Emmanuel J. Candès, Benjamin Recht
COMGEO
2006
ACM
13 years 6 months ago
Exact, efficient, and complete arrangement computation for cubic curves
Arno Eigenwillig, Lutz Kettner, Elmar Schömer...
DM
2008
145views more  DM 2008»
13 years 6 months ago
Clique coverings and partitions of line graphs
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
Bo-Jr Li, Gerard J. Chang