Sciweavers

12194 search results - page 209 / 2439
» Numberings Optimal for Learning
Sort
View
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
15 years 6 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
AAMAS
2006
Springer
15 years 6 months ago
Handling Communication Restrictions and Team Formation in Congestion Games
Abstract. There are many domains in which a multi-agent system needs to maximize a "system utility" function which rates the performance of the entire system, while subje...
Adrian K. Agogino, Kagan Tumer
CORR
2010
Springer
163views Education» more  CORR 2010»
15 years 4 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
CVPR
2004
IEEE
16 years 8 months ago
Model-Based Motion Clustering Using Boosted Mixture Modeling
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
Vladimir Pavlovic
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 11 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor