1158 search results - page 45 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
140
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
143
Voted
IJCV
2012
13 years 7 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
143
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
154
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
156
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...