3874 search results - page 527 / 775 » Approximation Algorithms for k-hurdle Problems |
147
click to vote
ALENEX
2009
15 years 5 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
127
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
148
click to vote
SODA
2012
ACM
13 years 7 months 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...
160
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
139
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...