Sciweavers

2723 search results - page 504 / 545
» Learning lexicographic orders
Sort
View
ICONIP
2007
15 years 20 days ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
TRECVID
2008
15 years 19 days ago
National Institute of Informatics, Japan at TRECVID 2008
This paper reports our experiments for TRECVID 2008 tasks: high level feature extraction, search and contentbased copy detection. For the high level feature extraction task, we use...
Duy-Dinh Le, Xiaomeng Wu, Shin'ichi Satoh, Sheetal...
IJCAI
2003
15 years 18 days ago
Bayesian Information Extraction Network
Dynamic Bayesian networks (DBNs) offer an elegant way to integrate various aspects of language in one model. Many existing algorithms developed for learning and inference in DBNs ...
Leonid Peshkin, Avi Pfeffer
NIPS
1998
15 years 17 days ago
Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
Michael J. Kearns, Satinder P. Singh
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 9 days ago
Evolutionary swarm design of architectural idea models
In this paper we present a swarm grammar system that makes use of bio-inspired mechanisms of reproduction, communication and construction in order to build three-dimensional struc...
Sebastian von Mammen, Christian Jacob