Sciweavers

14165 search results - page 523 / 2833
» The generalized two-server problem
Sort
View
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
13 years 9 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
13 years 9 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko
TKDE
2012
207views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Mining Web Graphs for Recommendations
—As the exponential explosion of various contents generated on the Web, Recommendation techniques have become increasingly indispensable. Innumerable different kinds of recommend...
Hao Ma, Irwin King, Michael R. Lyu
TMC
2012
13 years 9 months ago
A Statistical Mechanics-Based Framework to Analyze Ad Hoc Networks with Random Access
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
Sunil Srinivasa, Martin Haenggi
AAAI
2012
13 years 9 months ago
Learning Games from Videos Guided by Descriptive Complexity
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speciï...
Lukasz Kaiser