Sciweavers

STOC
2012
ACM
192views Algorithms» more  STOC 2012»
13 years 7 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 ...
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
13 years 7 months ago
From irreducible representations to locally decodable codes
Locally Decodable Code (LDC) is a code that encodes a message in a way that one can decode any particular symbol of the message by reading only a constant number of locations, eve...
Klim Efremenko
STOC
2012
ACM
185views Algorithms» more  STOC 2012»
13 years 7 months ago
Subspace evasive sets
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
Zeev Dvir, Shachar Lovett
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 7 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
STOC
2012
ACM
222views Algorithms» more  STOC 2012»
13 years 7 months ago
An analysis of one-dimensional schelling segregation
We analyze the Schelling model of segregation in which a society of n individuals live in a ring. Each individual is one of two races and is only satisfied with his location so l...
Christina Brandt, Nicole Immorlica, Gautam Kamath,...
STOC
2012
ACM
219views Algorithms» more  STOC 2012»
13 years 7 months ago
Prior-free auctions with ordered bidders
Stefano Leonardi, Tim Roughgarden
SIGIR
2012
ACM
13 years 7 months ago
Frontiers, challenges, and opportunities for information retrieval: Report from SWIRL 2012 the second strategic workshop on info
During a three-day workshop in February 2012, 45 Information Retrieval researchers met to discuss long-range challenges and opportunities within the field. The result of the works...
James Allan, W. Bruce Croft, Alistair Moffat, Mark...
SIGIR
2012
ACM
13 years 7 months ago
Search, interrupted: understanding and predicting search task continuation
Many important search tasks require multiple search sessions to complete. Tasks such as travel planning, large purchases, or job searches can span hours, days, or even weeks. Inev...
Eugene Agichtein, Ryen W. White, Susan T. Dumais, ...
SIGIR
2012
ACM
13 years 7 months ago
Will this #hashtag be popular tomorrow?
Hashtags are widely used in Twitter to define a shared context for events or topics. In this paper, we aim to predict hashtag popularity in near future (i.e., next day). Given a ...
Zongyang Ma, Aixin Sun, Gao Cong
SIGIR
2012
ACM
13 years 7 months ago
Effect of written instructions on assessor agreement
Assessors frequently disagree on the topical relevance of documents. How much of this disagreement is due to ambiguity in assessment instructions? We have two assessors assess TRE...
William Webber, Bryan Toth, Marjorie Desamito