Sciweavers

419 search results - page 14 / 84
» First Order Paths in Ordered Trees
Sort
View
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 9 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
AIRS
2008
Springer
14 years 2 months ago
Study of Kernel-Based Methods for Chinese Relation Extraction
Abstract. In this paper, we mainly explore the effectiveness of two kernelbased methods, the convolution tree kernel and the shortest path dependency kernel, for Chinese relation e...
Ruihong Huang, Le Sun, Yuanyong Feng
NAACL
2010
13 years 6 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ESSLLI
1999
Springer
14 years 26 days ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann