Sciweavers

9716 search results - page 198 / 1944
» The Case for Energy-Proportional Computing
Sort
View
VMV
2008
151views Visualization» more  VMV 2008»
15 years 8 months ago
Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
Marc Gissler, Matthias Teschner
IANDC
2007
117views more  IANDC 2007»
15 years 6 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
SIGCSE
2008
ACM
169views Education» more  SIGCSE 2008»
15 years 6 months ago
APOGEE: automated project grading and instant feedback system for web based computing
Providing consistent, instant, and detailed feedback to students has been a big challenge in teaching Web based computing, given the complexity of project assignments and the comp...
Xiang Fu, Boris Peltsverger, Kai Qian, Lixin Tao, ...
TC
2008
15 years 6 months ago
Adaptive Fault Management of Parallel Applications for High-Performance Computing
As the scale of high-performance computing (HPC) continues to grow, failure resilience of parallel applications becomes crucial. In this paper, we present FT-Pro, an adaptive fault...
Zhiling Lan, Yawei Li
CGF
2004
158views more  CGF 2004»
15 years 6 months ago
Combined Correlated and Importance Sampling in Direct Light Source Computation and Environment Mapping
This paper presents a general variance reduction method that is a quasi-optimal combination of correlated and importance sampling. The weights of the combination are selected auto...
László Szécsi, Mateu Sbert, L...