Sciweavers

1805 search results - page 71 / 361
» Functional programming with structured graphs
Sort
View
ICASSP
2010
IEEE
13 years 10 months ago
Large margin estimation of n-gram language models for speech recognition via linear programming
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
Vladimir Magdin, Hui Jiang
SETA
2004
Springer
93views Mathematics» more  SETA 2004»
14 years 4 months ago
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
Lars Eirik Danielsen, Matthew G. Parker
JMLR
2010
149views more  JMLR 2010»
13 years 5 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
AI
2008
Springer
13 years 10 months ago
Conditional independence and chain event graphs
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
Jim Q. Smith, Paul E. Anderson
HASKELL
2008
ACM
13 years 11 months ago
Clase: cursor library for a structured editor
The “zipper” is a well known design pattern for providing a cursorlike interface to a data structure. However, the classic treatise by Huet only scratches the surface of some ...
Tristan O. R. Allwood, Susan Eisenbach