Sciweavers

1403 search results - page 170 / 281
» Sampling Techniques for Kernel Methods
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Exemplar-based Sparse Representation phone identification features
Exemplar-based techniques, such as k-nearest neighbors (kNNs) and Sparse Representations (SRs), can be used to model a test sample from a few training points in a dictionary set. ...
Tara N. Sainath, David Nahamoo, Bhuvana Ramabhadra...
ISBI
2006
IEEE
15 years 4 months ago
x-f SENSE: optimal spatio-temporal sensitivity encoding for dynamic MR imaging
For high quality MR imaging of time-varying objects such as beating heart or brain hemodynamics, we need to reduce signal acquisition time without sacrificing the spatial resolut...
Jinhee Kim, Jong Chul Ye, Jaehung Yoo
VISUALIZATION
2000
IEEE
15 years 2 months ago
Semi-regular mesh extraction from volumes
We present a novel method to extract iso-surfaces from distance volumes. It generates high quality semi-regular multiresolution meshes of arbitrary topology. Our technique proceed...
Zoë J. Wood, Peter Schröder, David E. Br...
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
15 years 1 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 1 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...