Sciweavers

1047 search results - page 83 / 210
» Learning the required number of agents for complex tasks
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
ICML
2004
IEEE
14 years 8 months ago
A fast iterative algorithm for fisher discriminant using heterogeneous kernels
We propose a fast iterative classification algorithm for Kernel Fisher Discriminant (KFD) using heterogeneous kernel models. In contrast with the standard KFD that requires the us...
Glenn Fung, Murat Dundar, Jinbo Bi, R. Bharat Rao
PAMI
2006
106views more  PAMI 2006»
13 years 7 months ago
Statistical Analysis of Dynamic Actions
Real-world action recognition applications require the development of systems which are fast, can handle a large variety of actions without a priori knowledge of the type of actio...
Lihi Zelnik-Manor, Michal Irani
ATAL
2008
Springer
13 years 9 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...
AICOM
2000
105views more  AICOM 2000»
13 years 7 months ago
Emergence of Vowel Systems Through Self-Organisation
This paper describes a model of the emergence and the universal structural tendencies of vowel systems. Both are considered as the result of self-organisation in a population of l...
Bart de Boer