Sciweavers

656 search results - page 54 / 132
» Marrying Words and Trees
Sort
View
ACTAC
2008
97views more  ACTAC 2008»
15 years 6 months ago
$M$-Solid Varieties of Languages
In this paper, a characterization of the language varieties and congruence varieties corresponding to M-solid pseudovarieties is presented. Taking into account the isomorphisms of...
Pedro Baltazar
CORR
2006
Springer
88views Education» more  CORR 2006»
15 years 6 months ago
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
Wim Martens, Frank Neven, Marc Gyssens
IJCGA
2006
85views more  IJCGA 2006»
15 years 6 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
JACM
2010
208views more  JACM 2010»
15 years 4 months ago
The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies
clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...
David M. Blei, Thomas L. Griffiths, Michael I. Jor...
131
Voted
ACL
2009
15 years 4 months ago
Non-Projective Dependency Parsing in Expected Linear Time
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
Joakim Nivre