Sciweavers

22 search results - page 1 / 5
» Estimation of Stochastic Attribute-Value Grammars using an I...
Sort
View
COLING
2000
13 years 6 months ago
Estimation of Stochastic Attribute-Value Grammars using an Informative Sample
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
Miles Osborne
ANLP
2000
106views more  ANLP 2000»
13 years 6 months ago
Exploiting auxiliary distributions in stochastic unification-based grammars
This paper describes a method for estimating conditional probability distributions over the parses of "unification-based" grammars which can utilize auxiliary distributi...
Mark Johnson, Stefan Riezler
ICASSP
2011
IEEE
12 years 8 months ago
Langevin and hessian with fisher approximation stochastic sampling for parameter estimation of structured covariance
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...
Cornelia Vacar, Jean-François Giovannelli, ...
TIP
2010
88views more  TIP 2010»
12 years 11 months ago
Efficient Stereoscopic Ranging via Stochastic Sampling of Match Quality
We present an efficient method that computes dense stereo correspondences by stochastically sampling match quality values. Nonexhaustive sampling facilitates the use of quality met...
Thayne Richard Coffman, Alan Conrad Bovik
FOCI
2007
IEEE
13 years 11 months ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe