Sciweavers

867 search results - page 32 / 174
» The Generalized Maximum Coverage Problem
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 8 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
14 years 2 months ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo
JMLR
2010
123views more  JMLR 2010»
13 years 6 months ago
Maximum Relative Margin and Data-Dependent Regularization
Leading classification methods such as support vector machines (SVMs) and their counterparts achieve strong generalization performance by maximizing the margin of separation betw...
Pannagadatta K. Shivaswamy, Tony Jebara
ICALP
2011
Springer
12 years 11 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
KDD
2001
ACM
149views Data Mining» more  KDD 2001»
14 years 8 months ago
Maximum entropy methods for biological sequence modeling
Many of the same modeling methods used in natural languages, speci cally Markov models and HMM's, have also been applied to biological sequence analysis. In recent years, nat...
Eugen C. Buehler, Lyle H. Ungar