666 search results - page 93 / 134 » When Similar Problems Don't Have Similar Solutions |
253
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
308
Voted
ROCAI
2004
Springer
15 years 11 months ago
2004
Springer
We introduce a model class for statistical learning which is based on mixtures of propositional rules. In our mixture model, the weight of a rule is not uniform over the entire ins...
179
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
164
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
188
click to vote
CCR
2002
15 years 5 months ago
2002
Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within a narrow range of operating conditions. This rigid design re...