Sciweavers

104 search results - page 4 / 21
» Dependency trees in sub-linear time and bounded memory
Sort
View
DATE
2005
IEEE
169views Hardware» more  DATE 2005»
14 years 2 months ago
Context-Aware Scheduling Analysis of Distributed Systems with Tree-Shaped Task-Dependencies
In this paper we present a new technique which exploits timing-correlation between tasks for scheduling analysis in multiprocessor and distributed systems with tree-shaped task-de...
Rafik Henia, Rolf Ernst
EMNLP
2007
13 years 10 months ago
Experiments with a Higher-Order Projective Dependency Parser
We present experiments with a dependency parsing model defined on rich factors. Our model represents dependency trees with factors that include three types of relations between t...
Xavier Carreras
DATE
2007
IEEE
150views Hardware» more  DATE 2007»
14 years 3 months ago
Fast memory footprint estimation based on maximal dependency vector calculation
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
Qubo Hu, Arnout Vandecappelle, Per Gunnar Kjeldsbe...
CGF
2008
83views more  CGF 2008»
13 years 8 months ago
Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays
Photorealistic image synthesis is a computationally demanding task that relies on ray tracing for the evaluation of integrals. Rendering time is dominated by tracing long paths th...
Holger Dammertz, Johannes Hanika, Alexander Keller
FOCS
1989
IEEE
14 years 25 days ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel