723 search results - page 31 / 145 » Learning a Hidden Subgraph |
WWW
2004
ACM
14 years 8 months ago
2004
ACM
In the problem of learning with positive and unlabeled examples, existing research all assumes that positive examples P and the hidden positive examples in the unlabeled set U are...
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
We describe a probabilistic approach for supervised learning when we have multiple experts/annotators providing (possibly noisy) labels but no absolute gold standard. The proposed...
PERCOM
2003
ACM
14 years 24 days ago
2003
ACM
Seeking to extend the functional capability of the elderly, we explore the use of probabilistic methods to learn and recognise human activity in order to provide monitoring suppor...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose a framework to learn scene semantics from surveillance videos. Using the learnt scene semantics, a video analyst can efficiently and effectively retrieve the hidden sem...