Sciweavers

388 search results - page 72 / 78
» The covering number in learning theory
Sort
View
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 7 months ago
The Use of Probabilistic Systems to Mimic the Behaviour of Idiotypic AIS Robot Controllers
Previous work has shown that robot navigation systems that employ an architecture based upon the idiotypic network theory of the immune system have an advantage over control techn...
Amanda M. Whitbrook, Uwe Aickelin, Jonathan M. Gar...
TCS
2008
13 years 7 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
CORR
2010
Springer
163views Education» more  CORR 2010»
13 years 5 months ago
Faster Rates for training Max-Margin Markov Networks
Structured output prediction is an important machine learning problem both in theory and practice, and the max-margin Markov network (M3 N) is an effective approach. All state-of-...
Xinhua Zhang, Ankan Saha, S. V. N. Vishwanathan
MP
2011
13 years 2 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
ATAL
2011
Springer
12 years 7 months ago
Game theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Sam Ganzfried, Tuomas Sandholm