Sciweavers

2372 search results - page 267 / 475
» is 2012
Sort
View
SIGIR
2012
ACM
12 years 1 months ago
Identifying entity aspects in microblog posts
Online reputation management is about monitoring and handling the public image of entities (such as companies) on the Web. An important task in this area is identifying aspects of...
Damiano Spina, Edgar Meij, Maarten de Rijke, Andre...
STOC
2012
ACM
185views Algorithms» more  STOC 2012»
12 years 1 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
192views Algorithms» more  STOC 2012»
12 years 1 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
221views Algorithms» more  STOC 2012»
12 years 1 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
STOC
2012
ACM
193views Algorithms» more  STOC 2012»
12 years 1 months ago
A new point of NP-hardness for unique games
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
Ryan O'Donnell, John Wright