1380 search results - page 244 / 276 » A General Polynomial Sieve |
128
click to vote
JMLR
2008
15 years 1 months ago
2008
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
135
Voted
MOR
2008
15 years 1 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
103
Voted
MP
1998
15 years 1 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
123
click to vote
SIAMSC
2010
14 years 8 months ago
2010
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
159
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...