Sciweavers

6365 search results - page 1090 / 1273
» Fast Local Computation Algorithms
Sort
View
ICCV
2009
IEEE
15 years 4 months ago
On optimizing subspaces for face recognition
We propose a subspace learning algorithm for face recognition by directly optimizing recognition performance scores. Our approach is motivated by the following observations: 1) Di...
Jilin Tu, Xiaoming Liu, Peter Henry Tu
TMI
2010
155views more  TMI 2010»
15 years 1 months ago
Tubular Surface Segmentation for Extracting Anatomical Structures From Medical Imagery
Abstract--This work provides a model for tubular structures, and devises an algorithm to automatically extract tubular anatomical structures from medical imagery. Our model fits ma...
Vandana Mohan, Ganesh Sundaramoorthi, Allen Tannen...
CSB
2003
IEEE
15 years 12 months ago
LOGOS: a modular Bayesian model for de novo motif detection
The complexity of the global organization and internal structures of motifs in higher eukaryotic organisms raises significant challenges for motif detection techniques. To achiev...
Eric P. Xing, Wei Wu, Michael I. Jordan, Richard M...
MSS
2003
IEEE
151views Hardware» more  MSS 2003»
15 years 12 months ago
Accurate Modeling of Cache Replacement Policies in a Data Grid
Caching techniques have been used to improve the performance gap of storage hierarchies in computing systems. In data intensive applications that access large data files over wid...
Ekow J. Otoo, Arie Shoshani
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
15 years 10 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
« Prev « First page 1090 / 1273 Last » Next »