Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ECCC
2010
87views more  ECCC 2010»
10 years 9 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...
CORR
2010
Springer
127views Education» more  CORR 2010»
10 years 9 months ago
Towards a communication-theoretic understanding of system-level power consumption
Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be signif...
Pulkit Grover, Kristen Ann Woyach, Anant Sahai
CC
2010
Springer
120views System Software» more  CC 2010»
10 years 9 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
ICSOC
2009
Springer
10 years 9 months ago
An Initial Proposal for Data-Aware Resource Analysis of Orchestrations with Applications to Predictive Monitoring
Several activities in service oriented computing can benefit from knowing ahead of time future properties of a given service composition. In this paper we focus on how statically i...
Dragan Ivanovic, Manuel Carro, Manuel V. Hermenegi...
DLT
2009
10 years 9 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer
MFCS
2010
Springer
10 years 9 months ago
Weights of Exact Threshold Functions
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
László Babai, Kristoffer Arnsfelt Ha...
FOCS
2010
IEEE
10 years 9 months ago
The Complexity of Distributions
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
Emanuele Viola
CC
2010
Springer
282views System Software» more  CC 2010»
10 years 10 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
TCBB
2010
122views more  TCBB 2010»
10 years 10 months ago
On the Complexity of uSPR Distance
We show that subtree prune and regraft (uSPR) distance on unrooted trees is fixed parameter tractable with respect to the distance. We also make progress on a conjecture of Steel...
Maria Luisa Bonet, Katherine St. John
TALG
2010
74views more  TALG 2010»
10 years 10 months ago
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
Timothy M. Chan
books