Sciweavers

970 search results - page 164 / 194
» On encodings of spanning trees
Sort
View
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
14 years 2 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ADC
2008
Springer
143views Database» more  ADC 2008»
14 years 29 days ago
TRACK : A Novel XML Join Algorithm for Efficient Processing Twig Queries
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
Dongyang Li, Chunping Li
EMNLP
2008
14 years 12 days ago
Forest-based Translation Rule Extraction
Translation rule extraction is a fundamental problem in machine translation, especially for linguistically syntax-based systems that need parse trees from either or both sides of ...
Haitao Mi, Liang Huang
JNS
2010
61views more  JNS 2010»
13 years 9 months ago
Validity and Failure of the Boltzmann Approximation of Kinetic Annihilation
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...
Karsten Matthies, Florian Theil
ACL
2010
13 years 9 months ago
Simple, Accurate Parsing with an All-Fragments Grammar
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
Mohit Bansal, Dan Klein