Sciweavers

621 search results - page 67 / 125
» Parsing As Tree Traversal
Sort
View
ACL
2004
13 years 11 months ago
Long-Distance Dependency Resolution in Automatically Acquired Wide-Coverage PCFG-Based LFG Approximations
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
Aoife Cahill, Michael Burke, Ruth O'Donovan, Josef...
CAV
2012
Springer
231views Hardware» more  CAV 2012»
12 years 12 days ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 4 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
BDA
2006
13 years 11 months ago
Integrating Correction into Incremental Validation
Many data on the Web are XML documents. An XML document is an unranked labelled tree. A schema for XML documents (for instance a DTD) is the specification of their internal structu...
Béatrice Bouchou, Ahmed Cheriat, Mirian Hal...
CGF
2000
109views more  CGF 2000»
13 years 9 months ago
External Memory View-Dependent Simplification
In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use ...
Jihad El-Sana, Yi-Jen Chiang