Sciweavers

417 search results - page 55 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
SIAMSC
2010
121views more  SIAMSC 2010»
13 years 7 months ago
Extrapolated Implicit-Explicit Time Stepping
This paper constructs extrapolated implicit-explicit time stepping methods that allow one to efficiently solve problems with both stiff and nonstiff components. The proposed meth...
Emil M. Constantinescu, Adrian Sandu
SIAMMAX
2010
189views more  SIAMMAX 2010»
13 years 3 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 21 days ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
FCCM
2006
IEEE
111views VLSI» more  FCCM 2006»
14 years 2 months ago
Pipelined Mixed Precision Algorithms on FPGAs for Fast and Accurate PDE Solvers from Low Precision Components
FPGAs are becoming more and more attractive for high precision scientific computations. One of the main problems in efficient resource utilization is the quadratically growing r...
Robert Strzodka, Dominik Göddeke
CGF
1999
79views more  CGF 1999»
13 years 8 months ago
Stochastic Iteration for Non-diffuse Global Illumination
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
László Szirmay-Kalos