16093 search results - page 315 / 3219 » On the optimality of the neighbor-joining algorithm |
113
click to vote
DAGM
2003
Springer
16 years 3 hour ago
2003
Springer
Optimal labeling problems are NP-hard in many practically important cases. Sufficient conditions for optimal label detection in every pixel are formulated. Knowing the values of th...
168
click to vote
WADS
2005
Springer
16 years 7 days ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
192
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
224
click to vote
JMLR
2012
13 years 9 months ago
2012
In this paper, we propose to apply sparse canonical correlation analysis (sparse CCA) to an important genome-wide association study problem, eQTL mapping. Existing sparse CCA mode...
160
click to vote
TWC
2010
15 years 1 months ago
2010
We introduce a new sequential importance sampling (SIS) algorithm which propagates in time a Monte Carlo approximation of the posterior fixed-lag smoothing distribution of the symb...