2069 search results - page 306 / 414 » Linear time algorithms for Clobber |
171
click to vote
FOCS
2008
IEEE
16 years 26 days ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
175
click to vote
CAINE
2001
15 years 7 months ago
2001
In this paper, a new method for the approximation of discrete time state-affine systems is proposed. The method is based on the diagonalization of proposed generalized controllabi...
164
click to vote
IJCAI
2003
15 years 7 months ago
2003
We extend multiclass SVM to multiple prototypes per class. For this framework, we give a compact constrained quadratic problem and we suggest an efficient algorithm for its optimi...
171
click to vote
NIPS
2003
15 years 7 months ago
2003
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
155
click to vote
PPSC
1993
15 years 7 months ago
1993
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...