164 search results - page 24 / 33 » Maximally joining probabilistic data |
RECOMB
2003
Springer
15 years 10 months ago
2003
Springer
We propose a framework for modeling sequence motifs based on the maximum entropy principle (MEP). We recommend approximating short sequence motif distributions with the maximum en...
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
105
click to vote
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
In many Web applications, such as blog classification and newsgroup classification, labeled data are in short supply. It often happens that obtaining labeled data in a new domain ...
103
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Rapid growth in the amount of data available on social networking sites has made information retrieval increasingly challenging for users. In this paper, we propose a collaborativ...
AAAI
1998
14 years 11 months ago
1998
In many important text classification problems, acquiring class labels for training documents is costly, while gathering large quantities of unlabeled data is cheap. This paper sh...