995 search results - page 46 / 199 » nips 2007 |
115
click to vote
NIPS
2004
15 years 1 months ago
2004
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
82
Voted
NIPS
2001
15 years 1 months ago
2001
We propose randomized techniques for speeding up Kernel Principal Component Analysis on three levels: sampling and quantization of the Gram matrix in training, randomized rounding...
108
Voted
NIPS
2001
15 years 1 months ago
2001
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
88
Voted
NIPS
2001
15 years 1 months ago
2001
In packet switches, packets queue at switch inputs and contend for outputs. The contention arbitration policy directly affects switch performance. The best policy depends on the c...
NIPS
2001
15 years 1 months ago
2001
We propose a new classification for multi-agent learning algorithms, with each league of players characterized by both their possible strategies and possible beliefs. Using this c...