Sciweavers

3466 search results - page 108 / 694
» Fast computation of special resultants
Sort
View
79
Voted
BIRTHDAY
2005
Springer
15 years 6 months ago
Agents with Exact Foreknowledge
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
Jim Doran
CGO
2008
IEEE
15 years 7 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
93
Voted
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
15 years 2 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
RT
2000
Springer
15 years 4 months ago
Fast Global Illumination Including Specular Effects
Rapidly simulating global illumination, including diffuse and glossy light transport is a very difficult problem. Finite element or radiosity approaches can achieve interactive si...
Xavier Granier, George Drettakis, Bruce Walter
120
Voted
SIAMMAX
2010
189views more  SIAMMAX 2010»
14 years 7 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