Sciweavers

4302 search results - page 442 / 861
» Index Pairs Algorithms
Sort
View
WSCG
2004
142views more  WSCG 2004»
15 years 8 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
NIPS
2003
15 years 8 months ago
Can We Learn to Beat the Best Stock
A novel algorithm for actively trading stocks is presented. While traditional universal algorithms (and technical trading heuristics) attempt to predict winners or trends, our app...
Allan Borodin, Ran El-Yaniv, Vincent Gogan
IJCAI
1997
15 years 8 months ago
Equational Reasoning using AC Constraints
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
David A. Plaisted, Yunshan Zhu
159
Voted
VMV
2007
122views Visualization» more  VMV 2007»
15 years 8 months ago
An iterative framework for registration with reconstruction
The core of most registration algorithms aligns scan data by pairs, minimizing their relative distance. This local optimization must generally pass through a validation procedure t...
Thales Vieira, Adelailson Peixoto, Luiz Velho, Tho...
223
Voted
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
15 years 8 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen