895 search results - page 21 / 179 » Using graphs for some discrete tomography problems |
DAGM
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
JMLR
2012
11 years 9 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
PARA
1994
Springer
13 years 11 months ago
1994
Springer
A model describing the full quantum mechanical three body problem of the hydrogen molecular ion is presented, and some of the numerical results are subsequently discussed. The ove...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...