Sciweavers

991 search results - page 23 / 199
» The query-flow graph: model and applications
Sort
View
BMCBI
2004
120views more  BMCBI 2004»
13 years 10 months ago
Clustering under the line graph transformation: application to reaction network
Background: Many real networks can be understood as two complementary networks with two kind of nodes. This is the case of metabolic networks where the first network has chemical ...
Jose C. Nacher, Nobuhisa Ueda, Takuji Yamada, Mino...
VC
2010
197views more  VC 2010»
13 years 5 months ago
A high dynamic range rendering pipeline for interactive applications
High Dynamic Range (HDR) rendering has a growing success in video-games and virtual reality applications, as it improves the image quality and the player's immersion feeling....
Josselin Petit, Roland Brémond
CGF
1999
125views more  CGF 1999»
13 years 10 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
PPOPP
2012
ACM
12 years 6 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
DICS
2006
14 years 2 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules: A Programmer's Perspective
Dynamic Parallel Schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automa...
Sebastian Gerlach, Basile Schaeli, Roger D. Hersch