Sciweavers

537 search results - page 44 / 108
» A new upper bound for 3-SAT
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 2 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
CORR
2009
Springer
114views Education» more  CORR 2009»
14 years 7 months ago
Distributed Branching Bisimulation Minimization by Inductive Signatures
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
Stefan Blom, Jaco van de Pol
TIT
2008
94views more  TIT 2008»
14 years 10 months ago
Why Do Block Length and Delay Behave Differently if Feedback Is Present?
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...
Anant Sahai
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 5 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
INFOCOM
2008
IEEE
15 years 4 months ago
Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers
—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees ar...
Gianluca Rizzo, Jean-Yves Le Boudec