Sciweavers

882 search results - page 17 / 177
» On self-embeddings of computable linear orderings
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Learning the Linear Dynamical System with ASOS
We develop a new algorithm, based on EM, for learning the Linear Dynamical System model. Called the method of Approximated Second-Order Statistics (ASOS) our approach achieves dra...
James Martens
NAACL
2010
13 years 5 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...
ACL
2011
12 years 11 months ago
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino,...
CONCUR
2000
Springer
13 years 11 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
TCS
2010
13 years 2 months ago
Definable transductions and weighted logics for texts
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...
Christian Mathissen