Sciweavers

1686 search results - page 241 / 338
» Programs as polygraphs: computability and complexity
Sort
View
163
Voted
ICA3PP
2010
Springer
15 years 8 months ago
Accelerating Euler Equations Numerical Solver on Graphics Processing Units
Abstract. Finite volume numerical methods have been widely studied, implemented and parallelized on multiprocessor systems or on clusters. Modern graphics processing units (GPU) pr...
Pierre Kestener, Frédéric Chât...
SIGGRAPH
1999
ACM
15 years 8 months ago
Optimization of Mesh Locality for Transparent Vertex Caching
Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching...
Hugues Hoppe
ICCSA
2007
Springer
15 years 7 months ago
Component Specification for Parallel Coupling Infrastructure
Coupled systems comprise multiple interacting subsystems and are an increasingly common computational science application, most notably as multiscale and multiphysics models. Paral...
Jay Walter Larson, Boyana Norris
DCAI
2008
15 years 5 months ago
The Intelligent Butler: A Virtual Agent for Disabled and Elderly People Assistance
Abstract. Social assistance constitutes an increasing problem in developed countries, which can be considered from two dimensions: the home and the hospital frameworks. Anyway, mos...
Gabriel Fiol-Roig, Diana Arellano, Francisco J. Pe...
BIRTHDAY
2009
Springer
15 years 10 months ago
Is the World Linear?
Super-resolution is the art of creating nice high-resolution raster images from given low-resolution raster images. Since “nice” is not a well-defined term in mathematics and ...
Rudolf Fleischer