216 search results - page 8 / 44 » Learning Minimum Volume Sets |
AIRS
2005
Springer
14 years 3 months ago
2005
Springer
Query expansion techniques generally select new query terms from a set of top ranked documents. Although a user’s manual judgment of those documents would much help to select goo...
MICCAI
2005
Springer
14 years 10 months ago
2005
Springer
We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimizat...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
ICML
1996
IEEE
14 years 10 months ago
1996
IEEE
This paper discusses the unsupervised learning problem. An important part of the unsupervised learning problem is determining the numberofconstituent groups (componentsor classes)...
JMLR
2010
13 years 4 months ago
2010
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...