Sciweavers

1527 search results - page 120 / 306
» Hidden word statistics
Sort
View
CORR
2011
Springer
214views Education» more  CORR 2011»
14 years 5 months ago
Convex Approaches to Model Wavelet Sparsity Patterns
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as d...
Nikhil S. Rao, Robert D. Nowak, Stephen J. Wright,...
NIPS
1997
15 years 2 months ago
Learning Human-like Knowledge by Singular Value Decomposition: A Progress Report
Singular value decomposition (SVD) can be viewed as a method for unsupervised training of a network that associates two classes of events reciprocally by linear connections throug...
Thomas K. Landauer, Darrell Laham, Peter W. Foltz
INFOCOM
2000
IEEE
15 years 5 months ago
Effective Envelopes: Statistical Bounds on Multiplexed Traffic in Packet Networks
Abstract--A statistical network service which allows a certain fraction of traffic to not meet its QoS guarantees can extract additional capacity from a network by exploiting stati...
Robert Boorstyn, Almut Burchard, Jörg Liebehe...
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 5 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 5 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns