1717 search results - page 45 / 344 » A Computable Spectral Theorem |
130
Voted
SARA
2007
Springer
15 years 10 months ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
153
click to vote
JMLR
2010
14 years 10 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
146
Voted
SIAMCOMP
2010
15 years 2 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
146
Voted
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...
166
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
Spectral clustering and path-based clustering are two recently developed clustering approaches that have delivered impressive results in a number of challenging clustering tasks. ...