Sciweavers

9842 search results - page 1694 / 1969
» Problem complexity
Sort
View
CGF
2006
115views more  CGF 2006»
15 years 6 months ago
Reflected-Scene Impostors for Realistic Reflections at Interactive Rates
We present a technique for rendering reflections on complex reflectors at interactive rates based on approximating the geometry of the reflected scene with impostors. The reflecti...
Voicu Popescu, Chunhui Mei, Jordan Dauble, Elisha ...
CN
2006
79views more  CN 2006»
15 years 6 months ago
Explicit rate multicast congestion control
In this article, we propose a new single-rate end-to-end multicast congestion control scheme called Explicit Rate Multicast Congestion Control (ERMCC) based on a new metric, TRAC ...
Jiang Li, Murat Yuksel, Shivkumar Kalyanaraman
COMPUTING
2006
130views more  COMPUTING 2006»
15 years 6 months ago
Factorized Solution of Lyapunov Equations Based on Hierarchical Matrix Arithmetic
We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by format...
Ulrike Baur, Peter Benner
183
Voted
CONCURRENCY
2006
111views more  CONCURRENCY 2006»
15 years 6 months ago
ScyFlow: an environment for the visual specification and execution of scientific workflows
With the advent of grid technologies, scientists and engineers are building more and more complex applications to utilize distributed grid resources. The core grid services provid...
Karen M. McCann, Maurice Yarrow, Adrian De Vivo, P...
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
« Prev « First page 1694 / 1969 Last » Next »