2446 search results - page 70 / 490 » Choiceless Polynomial Time |
JMLR
2010
13 years 2 months ago
2010
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact ...
MCM
2010
13 years 2 months ago
2010
SIAMCOMP
2010
13 years 2 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
DAM
2006
13 years 7 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
CSR
2010
Springer
14 years 14 days ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...