Sciweavers

Share
ACL
2012
6 years 5 months ago
A Comprehensive Gold Standard for the Enron Organizational Hierarchy
Many researchers have attempted to predict the Enron corporate hierarchy from the data. This work, however, has been hampered by a lack of data. We present a new, large, and freel...
Apoorv Agarwal, Adinoyi Omuya, Aaron Harnly, Owen ...
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
6 years 5 months ago
The shifting sands algorithm
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
Andrew McGregor, Paul Valiant
JMLR
2012
6 years 5 months ago
Contextual Bandit Learning with Predictable Rewards
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...
Alekh Agarwal, Miroslav Dudík, Satyen Kale,...
SIGMOD
2012
ACM
210views Database» more  SIGMOD 2012»
6 years 5 months ago
Interactive regret minimization
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, K...
CORR
2012
Springer
224views Education» more  CORR 2012»
6 years 11 months ago
On Approximation Lower Bounds for TSP with Bounded Metrics
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the b...
Marek Karpinski, Richard Schmied
IACR
2011
108views more  IACR 2011»
7 years 2 months ago
On lower bounds on second-order nonliearities of bent functions obtained by using Niho power functions
Abstract. In this paper we find a lower bound of the second-order nonlinearities of Boolean bent functions of the form f(x) = Trn 1 (α1xd1 + α2xd2 ), where d1 and d2 are Niho ex...
Manish Garg, Sugata Gangopadhyay
ALT
2011
Springer
7 years 3 months ago
Semantic Communication for Simple Goals Is Equivalent to On-line Learning
Abstract. Previous works [11, 6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for commun...
Brendan Juba, Santosh Vempala
ICALP
2011
Springer
7 years 6 months ago
Content Search through Comparisons
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
Amin Karbasi, Stratis Ioannidis, Laurent Massouli&...
CISS
2010
IEEE
7 years 6 months ago
On Gaussian MIMO compound wiretap channels
— We study the two-user one-eavesdropper discrete memoryless compound wiretap channel, where the transmitter sends a common confidential message to both users, which needs to be...
Ersen Ekrem, Sennur Ulukus
ICASSP
2011
IEEE
7 years 7 months ago
Analyzing the performance of error-prone relay networks
In this paper, we provide a semi-analytical method for predicting the upper and lower bound of the end-to-end mutual information for a relay network with practical codes and diffe...
Sebastian Vorköper, Volker Kühn
books