Sciweavers

1161 search results - page 162 / 233
» Kinetic Dependence Graphs
Sort
View
ICS
1995
Tsinghua U.
15 years 2 months ago
Optimum Modulo Schedules for Minimum Register Requirements
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
Alexandre E. Eichenberger, Edward S. Davidson, San...
69
Voted
ICS
1995
Tsinghua U.
15 years 2 months ago
Gated SSA-based Demand-Driven Symbolic Analysis for Parallelizing Compilers
In this paper, we present a GSA-based technique that performs more e cient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The e ciency...
Peng Tu, David A. Padua
SCA
2007
15 years 28 days ago
A decision network framework for the behavioral animation of virtual humans
We introduce a framework for advanced behavioral animation in virtual humans, which addresses the challenging open problem of simulating social interactions between pedestrians in...
Qinxin Yu, Demetri Terzopoulos
AAIM
2008
Springer
142views Algorithms» more  AAIM 2008»
15 years 3 days ago
Engineering Label-Constrained Shortest-Path Algorithms
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...
IFIP12
2008
14 years 12 months ago
A Risk Assessment System with Automatic Extraction of Event Types
In this article we describe the joint effort of experts in linguistics, information extraction and risk assessment to integrate EventSpotter, an automatic event extraction engine, ...
Philippe Capet, Thomas Delavallade, Takuya Nakamur...