1717 search results - page 12 / 344 » A Computable Spectral Theorem |
113
Voted
STOC
1999
ACM
15 years 8 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Both in the plane and in space, we invert the nonlinear Ullman transformation for 3 points and 3 orthographic cameras. While Ullman’s theorem assures a unique reconstruction mod...
145
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We present a new method for spectral clustering with paired data based on kernel canonical correlation analysis, called correlational spectral clustering. Paired data are common i...
149
Voted
PAKDD
2009
ACM
16 years 26 days ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
123
Voted
CCA
2005
Springer
15 years 5 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...