170 search results - page 10 / 34 » Cross-Composition: A New Technique for Kernelization Lower B... |
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
94
Voted
SODA
2012
ACM
13 years 1 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
113
click to vote
PAMI
2011
14 years 4 months ago
2011
—In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting ...