Sciweavers

575 search results - page 42 / 115
» A Spectral Approach to Lower Bounds
Sort
View
AML
2008
91views more  AML 2008»
13 years 11 months ago
On meta complexity of propositional formulas and propositional proofs
A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional languag...
Pavel Naumov
TMC
2010
138views more  TMC 2010»
13 years 9 months ago
Distributed Relay-Assignment Protocols for Coverage Expansion in Cooperative Wireless Networks
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...
Ahmed K. Sadek, Zhu Han, K. J. Ray Liu
PAMI
2006
145views more  PAMI 2006»
13 years 10 months ago
Convergent Tree-Reweighted Message Passing for Energy Minimization
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
Vladimir Kolmogorov
TIT
1998
79views more  TIT 1998»
13 years 10 months ago
Capacity of Two-Layer Feedforward Neural Networks with Binary Weights
— The lower and upper bounds for the information capacity of two-layer feedforward neural networks with binary interconnections, integer thresholds for the hidden units, and zero...
Chuanyi Ji, Demetri Psaltis
GLOBECOM
2007
IEEE
14 years 5 months ago
Output Traffic Characterization of Policers and Shapers with Long-Range Dependent Input Traffic
 Long-range dependence (LRD) is a largely verified property of Internet traffic, which severely affects network queuing. An approach for guaranteeing performance requirements is...
Stefano Bregni, Paolo Giacomazzi, Gabriella Saddem...