5995 search results - page 220 / 1199 » Algorithmic Game Theory |
141
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
138
Voted
NIPS
2008
15 years 5 months ago
2008
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound...
134
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
129
click to vote
JCB
2007
15 years 4 months ago
2007
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
141
Voted
CN
2004
15 years 4 months ago
2004
Abstract-- In this paper, we perform the first comprehensive study of the multicast address allocation problem. We analyze this problem both within its context as a classic resourc...