Sciweavers

1403 search results - page 5 / 281
» Sampling Techniques for Kernel Methods
Sort
View
ICIP
2008
IEEE
15 years 11 months ago
Subspace-based methods for image registration and super-resolution
Super-resolution algorithms combine multiple low resolution images into a single high resolution image. They have received a lot of attention recently in various application domai...
Patrick Vandewalle, Loïc Baboulaz, Pier Luigi...
JMLR
2010
162views more  JMLR 2010»
14 years 4 months ago
A Surrogate Modeling and Adaptive Sampling Toolbox for Computer Based Design
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
Dirk Gorissen, Ivo Couckuyt, Piet Demeester, Tom D...
78
Voted
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 3 months ago
Real-coded crossover as a role of kernel density estimation
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
Jun Sakuma, Shigenobu Kobayashi
ICCD
2007
IEEE
157views Hardware» more  ICCD 2007»
15 years 6 months ago
Combining cluster sampling with single pass methods for efficient sampling regimen design
Microarchitectural simulation is orders of magnitude slower than native execution. As more elements are accurately modeled, problems associated with slow simulation are further ex...
Paul D. Bryan, Thomas M. Conte
ASPDAC
1999
ACM
100views Hardware» more  ASPDAC 1999»
15 years 2 months ago
Node Sampling Technique to Speed Up Probability-Based Power Estimation Methods
We propose a new technique called node sampling to speed up the probability-based power estimation methods. It samples and processes only a small portion of total nodes to estimat...
Hoon Choi, Hansoo Kim, In-Cheol Park, Seung Ho Hwa...