Sciweavers

1548 search results - page 124 / 310
» Statistical Modelling of CSP Solving Algorithms Performance
Sort
View
ATAL
2008
Springer
15 years 8 months ago
MB-AIM-FSI: a model based framework for exploiting gradient ascent multiagent learners in strategic interactions
Future agent applications will increasingly represent human users autonomously or semi-autonomously in strategic interactions with similar entities. Hence, there is a growing need...
Doran Chakraborty, Sandip Sen
SI3D
2010
ACM
16 years 1 months ago
Volumetric obscurance
Obscurance and Ambient Occlusion (AO) are popular techniques in both film and games that model how ambient light is shadowed. While it is largely a solved problem for static scen...
Bradford James Loos, Peter-Pike Sloan
NIPS
1996
15 years 7 months ago
Transformation Invariance in Pattern Recognition-Tangent Distance and Tangent Propagation
In pattern recognition, statistical modeling, or regression, the amount of data is a critical factor affecting the performance. If the amount of data and computational resources ar...
Patrice Simard, Yann LeCun, John S. Denker, Bernar...
BMCBI
2010
158views more  BMCBI 2010»
15 years 6 months ago
Validation of differential gene expression algorithms: Application comparing fold-change estimation to hypothesis testing
Background: Sustained research on the problem of determining which genes are differentially expressed on the basis of microarray data has yielded a plethora of statistical algorit...
Corey M. Yanofsky, David R. Bickel
ECCV
2002
Springer
16 years 8 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel