230 search results - page 29 / 46 » Minimum Spanning Tree Problem with Label Selection |
TIT
1998
13 years 7 months ago
1998
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
JACM
2010
13 years 6 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
AAAI
2000
13 years 9 months ago
2000
Selective sampling, a form of active learning, reduces the cost of labeling training data by asking only for the labels of the most informative unlabeled examples. We introduce a ...
MOBIQUITOUS
2007
IEEE
14 years 1 months ago
2007
IEEE
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
CLEF
2009
Springer
13 years 5 months ago
2009
Springer
In this paper, we describe an approach for the automatic medical image annotation task of the 2009 CLEF cross-language image retrieval campaign (ImageCLEF). This work is focused o...