1158 search results - page 22 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
107
click to vote
NIPS
2001
15 years 12 days ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
113
click to vote
CATS
2006
15 years 13 days ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
INFOCOM
2009
IEEE
15 years 5 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
CPM
2005
Springer
15 years 4 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
109
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...