Sciweavers

968 search results - page 30 / 194
» A faster implementation of APlace
Sort
View
TOG
2002
121views more  TOG 2002»
15 years 1 months ago
A rapid hierarchical rendering technique for translucent materials
This paper introduces an efficient two-pass rendering technique for translucent materials. We decouple the computation of irradiance at the surface from the evaluation of scatteri...
Henrik Wann Jensen, Juan Buhler
FGCS
2010
76views more  FGCS 2010»
15 years 14 days ago
Self-healing network for scalable fault-tolerant runtime environments
Scalable and fault tolerant runtime environments are needed to support and adapt to the underlying libraries and hardware which require a high degree of scalability in dynamic larg...
Thara Angskun, Graham E. Fagg, George Bosilca, Jel...
IAJIT
2010
115views more  IAJIT 2010»
15 years 13 days ago
An Enhancement of Major Sorting Algorithms
: One of the fundamental issues in computer science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal o...
Jehad Alnihoud, Rami Mansi
TCBB
2010
114views more  TCBB 2010»
15 years 8 days ago
Cache-Oblivious Dynamic Programming for Bioinformatics
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
Rezaul Alam Chowdhury, Hai-son Le, Vijaya Ramachan...
TVCG
2010
141views more  TVCG 2010»
15 years 8 days ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar