2434 search results - page 144 / 487 » Algorithmic Randomness of Closed Sets |
141
Voted
IJCAI
1989
15 years 4 months ago
1989
Multilayered feedforward neural networks possess a number of properties which make them particularly suited to complex pattern classification problems. However, their application ...
174
Voted
FAW
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
135
Voted
ICALP
1998
Springer
15 years 8 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
152
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
140
Voted
PAMI
2007
15 years 3 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...