Sciweavers

2934 search results - page 393 / 587
» Hypothesis Spaces for Learning
Sort
View
DATE
2007
IEEE
167views Hardware» more  DATE 2007»
16 years 26 days ago
A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multip
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
Nadathur Satish, Kaushik Ravindran, Kurt Keutzer
PREMI
2005
Springer
16 years 1 hour ago
Eliciting Domain Knowledge in Handwritten Digit Recognition
Pattern recognition methods for complex structured objects such as handwritten characters often have to deal with vast search spaces. Developed techniques, despite significant adv...
Tuan Trung Nguyen
SLSFS
2005
Springer
15 years 12 months ago
Generalization Bounds for Subspace Selection and Hyperbolic PCA
We present a method which uses example pairs of equal or unequal class labels to select a subspace with near optimal metric properties in a kernel-induced Hilbert space. A represen...
Andreas Maurer
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
15 years 11 months ago
Using an Immune System Model to Explore Mate Selection in Genetic Algorithms
Abstract. When Genetic Algorithms (GAs) are employed in multimodal function optimization, engineering and machine learning, identifying multiple peaks and maintaining subpopulation...
Chien-Feng Huang
IJCAI
2007
15 years 8 months ago
Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis
Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysi...
Evgeniy Gabrilovich, Shaul Markovitch