5580 search results - page 247 / 1116 » Randomized priority algorithms |
221
click to vote
ACL
2006
15 years 7 months ago
2006
We present a new semi-supervised training procedure for conditional random fields (CRFs) that can be used to train sequence segmentors and labelers from a combination of labeled a...
140
click to vote
AAAI
1998
15 years 7 months ago
1998
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
188
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We present MI-CRF, a conditional random field (CRF) model for multiple instance learning (MIL). MI-CRF models bags as nodes in a CRF with instances as their states. It combines di...
164
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
184
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...