Sciweavers

1859 search results - page 48 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
CVPR
2012
IEEE
13 years 7 months ago
An online learned CRF model for multi-target tracking
We introduce an online learning approach for multitarget tracking. Detection responses are gradually associated into tracklets in multiple levels to produce final tracks. Unlike ...
Bo Yang, Ram Nevatia
SIGCSE
2004
ACM
132views Education» more  SIGCSE 2004»
15 years 10 months ago
Using game days to teach a multiagent system class
Multiagent systems is an attractive problem solving approach that is becoming ever more feasible and popular in today’s world. It combines artificial intelligence (AI) and distr...
Leen-Kiat Soh
AAAI
1994
15 years 5 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
13 years 7 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray
135
Voted
DIS
2009
Springer
15 years 11 months ago
MICCLLR: Multiple-Instance Learning Using Class Conditional Log Likelihood Ratio
Multiple-instance learning (MIL) is a generalization of the supervised learning problem where each training observation is a labeled bag of unlabeled instances. Several supervised ...
Yasser El-Manzalawy, Vasant Honavar