Sciweavers

485 search results - page 77 / 97
» Iterative Bounding LAO
Sort
View
PG
2007
IEEE
15 years 4 months ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang
PAKDD
2007
ACM
115views Data Mining» more  PAKDD 2007»
15 years 4 months ago
Intelligent Sequential Mining Via Alignment: Optimization Techniques for Very Large DB
The shear volume of the results in traditional support based frequent sequential pattern mining methods has led to increasing interest in new intelligent mining methods to find mo...
Hye-Chung Kum, Joong Hyuk Chang, Wei Wang 0010
STACS
2007
Springer
15 years 4 months ago
On Fixed Point Equations over Commutative Semirings
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
IJCNN
2006
IEEE
15 years 4 months ago
Sparse Optimization for Second Order Kernel Methods
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
Roland Vollgraf, Klaus Obermayer
SPAA
2005
ACM
15 years 3 months ago
Finding effective support-tree preconditioners
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ra...