Sciweavers

1964 search results - page 233 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
CGI
2004
IEEE
14 years 14 hour ago
Exploiting Temporal Coherence in Final Gathering for Dynamic Scenes
Efficient global illumination computation in dynamically changing environments is an important practical problem. In high-quality animation rendering costly "final gathering&...
Takehiro Tawara, Karol Myszkowski, Hans-Peter Seid...
ICANN
2010
Springer
13 years 8 months ago
Solving Independent Component Analysis Contrast Functions with Particle Swarm Optimization
Independent Component Analysis (ICA) is a statistical computation method that transforms a random vector in another one whose components are independent. Because the marginal distr...
Jorge Igual, Jehad I. Ababneh, Raul Llinares, Juli...
PAMI
2006
114views more  PAMI 2006»
13 years 8 months ago
Nonparametric Supervised Learning by Linear Interpolation with Maximum Entropy
Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of...
Maya R. Gupta, Robert M. Gray, Richard A. Olshen
IJCV
1998
157views more  IJCV 1998»
13 years 8 months ago
Stereo Matching with Nonlinear Diffusion
One of the central problems in stereo matching (and other image registration tasks) is the selection of optimal window sizes for comparing image regions. This paper addresses this ...
Daniel Scharstein, Richard Szeliski
BMCBI
2008
139views more  BMCBI 2008»
13 years 8 months ago
The C1C2: A framework for simultaneous model selection and assessment
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...
Martin Eklund, Ola Spjuth, Jarl E. S. Wikberg