Sciweavers

536 search results - page 91 / 108
» Residual Algorithms: Reinforcement Learning with Function Ap...
Sort
View
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
13 years 11 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
MLG
2007
Springer
14 years 1 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
COLT
2004
Springer
14 years 1 months ago
Graphical Economics
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
Sham Kakade, Michael J. Kearns, Luis E. Ortiz
ICMCS
2006
IEEE
192views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Classifier Optimization for Multimedia Semantic Concept Detection
In this paper, we present an AUC (i.e., the Area Under the Curve of Receiver Operating Characteristics (ROC)) maximization based learning algorithm to design the classifier for ma...
Sheng Gao, Qibin Sun
ICA
2012
Springer
12 years 3 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...