Sciweavers

3837 search results - page 363 / 768
» Learning Approximate Consistencies
Sort
View
ICML
2009
IEEE
16 years 1 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
16 years 1 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
16 years 11 days ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
MMM
2007
Springer
114views Multimedia» more  MMM 2007»
16 years 1 months ago
Mining Multiple Visual Appearances of Semantics for Image Annotation
This paper investigates the problem of learning the visual semantics of keyword categories for automatic image annotation. Supervised learning algorithms which learn only a single ...
Hung-Khoon Tan, Chong-Wah Ngo
UIC
2007
Springer
16 years 29 days ago
Ontology-Based Semantic Recommendation for Context-Aware E-Learning
Nowadays, e-learning systems are widely used for education and training in universities and companies because of their electronic course content access and virtual classroom partic...
Zhiwen Yu, Yuichi Nakamura, Seiie Jang, Shoji Kaji...