Sciweavers

6365 search results - page 209 / 1273
» Fast Local Computation Algorithms
Sort
View
GRAPHICSINTERFACE
2009
15 years 4 months ago
Fast low-memory streaming MLS reconstruction of point-sampled surfaces
We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, m...
Gianmauro Cuccuru, Enrico Gobbetti, Fabio Marton, ...
SMA
2010
ACM
177views Solid Modeling» more  SMA 2010»
15 years 6 months ago
Multi-level grid algorithms for faster molecular energetics
Bio-molecules reach their stable configuration in solvent which is primarily water with a small concentration of salt ions. One approximation of the total free energy of a bio-mol...
Rezaul Alam Chowdhury, Chandrajit L. Bajaj
193
Voted
CVPR
2006
IEEE
16 years 8 months ago
A Multi-Channel Algorithm for Edge Detection Under Varying Lighting
In vision-based autonomous spacecraft docking multiple views of scene structure captured with the same camera and scene geometry is available under different lighting conditions. ...
Wei Xu, Michael Jenkin, Yves Lespérance
PLDI
1993
ACM
15 years 10 months ago
Global Optimizations for Parallelism and Locality on Scalable Parallel Machines
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
Jennifer-Ann M. Anderson, Monica S. Lam
CCGRID
2006
IEEE
16 years 12 days ago
ReCon: A Fast and Reliable Replica Retrieval Service for the Data Grid
The Data Grid provides a scalable infrastructure for storage resources and data distribution management. It also supports a variety of scientific applications that require access...
XiaoLi Zhou, Eunsung Kim, Jai Wug Kim, Heon Young ...