Sciweavers

1686 search results - page 307 / 338
» Programs as polygraphs: computability and complexity
Sort
View
SIGGRAPH
1991
ACM
14 years 2 months ago
Visibility preprocessing for interactive walkthroughs
The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g....
Seth J. Teller, Carlo H. Séquin
SC
2009
ACM
14 years 5 months ago
Enabling high-fidelity neutron transport simulations on petascale architectures
The UNIC code is being developed as part of the DOE’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. UNIC is an unstructured, deterministic neutron transport c...
Dinesh K. Kaushik, Micheal Smith, Allan Wollaber, ...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 5 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
PDP
2007
IEEE
14 years 5 months ago
Improving the Development Process for CSE Software
Scientific and engineering programming has been around since the beginning of computing, often being the driving force for new system development and innovation. At the same time...
Michael A. Heroux, James M. Willenbring, Michael N...
CF
2006
ACM
14 years 4 months ago
Dynamic thread assignment on heterogeneous multiprocessor architectures
In a multi-programmed computing environment, threads of execution exhibit different runtime characteristics and hardware resource requirements. Not only do the behaviors of distin...
Michela Becchi, Patrick Crowley