Sciweavers

496 search results - page 24 / 100
» Lyapunov functionals and matrices
Sort
View
COCO
2007
Springer
92views Algorithms» more  COCO 2007»
14 years 1 months ago
Halfspace Matrices
A halfspace matrix is a Boolean matrix A with rows indexed by linear threshold functions f, columns indexed by inputs x ∈ {−1,1}n, and the entries given by Af,x = f(x). We dem...
Alexander A. Sherstov
DICTA
2009
13 years 5 months ago
Multi-projective Parameter Estimation for Sets of Homogeneous Matrices
A number of problems in computer vision require the estimation of a set of matrices, each of which is defined only up to an individual scale factor and represents the parameters of...
Wojciech Chojnacki, Rhys Hill, Anton van den Henge...
NIPS
2004
13 years 8 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
JCT
2006
89views more  JCT 2006»
13 years 7 months ago
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums
Let s = (s1, . . . , sm) and t = (t1, . . . , tn) be vectors of non-negative integervalued functions with equal sum S = m i=1 si = n j=1 tj. Let N(s, t) be the number of m
Catherine S. Greenhill, Brendan D. McKay, Xiaoji W...
DM
2010
77views more  DM 2010»
13 years 7 months ago
Representing (0, 1)-matrices by boolean circuits
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
Stasys Jukna