Sciweavers

391 search results - page 50 / 79
» Compositionality for Probabilistic Automata
Sort
View
MICCAI
2010
Springer
13 years 6 months ago
Probabilistic Multi-Shape Representation Using an Isometric Log-Ratio Mapping
Abstract. Several sources of uncertainties in shape boundaries in medical images have motivated the use of probabilistic labeling approaches. Although it is well-known that the sam...
Neda Changizi, Ghassan Hamarneh
POPL
2010
ACM
14 years 5 months ago
Semantics and Algorithms for Data-dependent Grammars
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
Yitzhak Mandelbaum, Trevor Jim, David Walker
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
14 years 7 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...
COLT
2006
Springer
13 years 11 months ago
Learning Rational Stochastic Languages
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
François Denis, Yann Esposito, Amaury Habra...
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 7 months ago
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...