Sciweavers

434 search results - page 21 / 87
» sum 2007
Sort
View
NIPS
2004
15 years 1 months ago
Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices
We prove generalization error bounds for predicting entries in a partially observed matrix by fitting the observed entries with a low-rank matrix. In justifying the analysis appro...
Nathan Srebro, Noga Alon, Tommi Jaakkola
COMBINATORICS
2007
60views more  COMBINATORICS 2007»
14 years 11 months ago
Higher Spin Alternating Sign Matrices
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partia...
Roger E. Behrend, Vincent A. Knight
77
Voted
CCCG
1993
15 years 1 months ago
The Floodlight Problem
Given three angles summing to 2, given n points in the plane and a tripartition k1 + k2 + k3 = n, we can tripartition the plane into three wedges of the given angles so that the ...
Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Ma...
DAGSTUHL
2007
15 years 1 months ago
Diagonal Circuit Identity Testing and Lower Bounds
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
Nitin Saxena
NIPS
2001
15 years 1 months ago
The Method of Quantum Clustering
We propose a novel clustering method that is an extension of ideas inherent to scale-space clustering and support-vector clustering. Like the latter, it associates every data poin...
David Horn, Assaf Gottlieb