Sciweavers

513 search results - page 57 / 103
» Finitely Based, Finite Sets of Words
Sort
View
ANLP
2000
124views more  ANLP 2000»
15 years 1 months ago
A Divide-and-Conquer Strategy for Shallow Parsing of German Free Texts
We present a divide-and-conquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sente...
Günter Neumann, Christian Braun, Jakub Piskor...
AUTOMATICA
2006
70views more  AUTOMATICA 2006»
14 years 12 months ago
A Toeplitz algorithm for polynomial J-spectral factorization
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can ha...
Juan Carlos Zúñiga, Didier Henrion
MP
2006
175views more  MP 2006»
14 years 11 months ago
Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse
In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models - studied in mathematical finance for several decades -...
Rüdiger Schultz, Stephan Tiedemann
SIAMCO
2010
201views more  SIAMCO 2010»
14 years 6 months ago
Analysis of Unconstrained Nonlinear MPC Schemes with Time Varying Control Horizon
For discrete time nonlinear systems satisfying an exponential or finite time controllability assumption, we present an analytical formula for a suboptimality estimate for model pre...
Lars Grüne, Jürgen Pannek, Martin Seehaf...
IANDC
2008
74views more  IANDC 2008»
14 years 12 months ago
Baire categories on small complexity classes and meager-comeager laws
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...
Philippe Moser