Sciweavers

79 search results - page 12 / 16
» Equivalent Number of Degrees of Freedom for Neural Networks
Sort
View
COLT
2006
Springer
13 years 11 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
SIROCCO
2004
13 years 8 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
CORR
2007
Springer
153views Education» more  CORR 2007»
13 years 7 months ago
Power-Bandwidth Tradeoff in Dense Multi-Antenna Relay Networks
— We consider a dense fading multi-user network with multiple active multi-antenna source-destination pair terminals communicating simultaneously through a large common set of K ...
Ozgur Oyman, Arogyaswami Paulraj
MA
2010
Springer
172views Communications» more  MA 2010»
13 years 5 months ago
On Monte Carlo methods for Bayesian multivariate regression models with heavy-tailed errors
We consider Bayesian analysis of data from multivariate linear regression models whose errors have a distribution that is a scale mixture of normals. Such models are used to analy...
Vivekananda Roy, James P. Hobert
JCPHY
2011
133views more  JCPHY 2011»
12 years 10 months ago
A Riemann solver for single-phase and two-phase shallow flow models based on relaxation. Relations with Roe and VFRoe solvers
We present a Riemann solver derived by a relaxation technique for classical single-phase shallow flow equations and for a two-phase shallow flow model describing a mixture of so...
Marica Pelanti, François Bouchut, Anne Mang...