2168 search results - page 152 / 434 » Randomized Algorithms and Complexity Theory |
118
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
152
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
129
click to vote
SIGMOD
1993
ACM
15 years 7 months ago
1993
ACM
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
116
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
133
Voted
SAGT
2010
Springer
15 years 1 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...