Sciweavers

1000 search results - page 35 / 200
» Dependency Tree Automata
Sort
View
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
ACL
2009
13 years 7 months ago
Composite Kernels For Relation Extraction
The automatic extraction of relations between entities expressed in natural language text is an important problem for IR and text understanding. In this paper we show how differen...
Frank Reichartz, Hannes Korte, Gerhard Paass
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 7 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
BMCBI
2004
121views more  BMCBI 2004»
13 years 9 months ago
Asynchronous adaptive time step in quantitative cellular automata modeling
Background: The behaviors of cells in metazoans are context dependent, thus large-scale multicellular modeling is often necessary, for which cellular automata are natural candidat...
Hao Zhu, Peter Y. H. Pang, Yan Sun, Pawan Dhar
ACL
2012
12 years 3 days ago
Extracting Narrative Timelines as Temporal Dependency Structures
We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations l...
Oleksandr Kolomiyets, Steven Bethard, Marie-Franci...