Sciweavers

CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 8 months ago
Canonical calculi with (n,k)-ary quantifiers
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Arnon Avron, Anna Zamansky
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 8 months ago
Privately Releasing Conjunctions and the Statistical Query Barrier
Suppose we would like to know all answers to a set of statistical queries C on a data set up to small error, but we can only access the data itself using statistical queries. A tr...
Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan U...
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 8 months ago
Outer Bounds for Multiple Access Channels with Feedback using Dependence Balance
We use the idea of dependence balance to obtain a new outer bound for the capacity region of the discrete memoryless multiple-access channel with noiseless feedback (MAC-FB). We co...
Ravi Tandon, Sennur Ulukus
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 8 months ago
An Experimental Investigation of XML Compression Tools
This paper presents an extensive experimental study of the state-of-the-art of XML compression tools. The study reports the behavior of nine XML compressors using a large corpus o...
Sherif Sakr
CORR
2008
Springer
54views Education» more  CORR 2008»
13 years 8 months ago
Finding Large Clique Minors is Hard
David Eppstein
CORR
2008
Springer
109views Education» more  CORR 2008»
13 years 8 months ago
Low-Complexity Structured Precoding for Spatially Correlated MIMO Channels
The focus of this paper is on spatial precoding in correlated multi-antenna channels, where the number of independent data-streams is adapted to trade-off the data-rate with the t...
Vasanthan Raghavan, Akbar M. Sayeed, Venugopal V. ...
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 8 months ago
Santa Claus Schedules Jobs on Unrelated Machines
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
Ola Svensson
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Learning Low-Density Separators
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
Shai Ben-David, Tyler Lu, Dávid Pál,...
CORR
2008
Springer
52views Education» more  CORR 2008»
13 years 8 months ago
Network Growth with Feedback
Raissa M. D'Souza, Soumen Roy