1158 search results - page 148 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
183
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
175
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
156
click to vote
JCO
2010
15 years 4 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
149
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
152
click to vote
WAOA
2004
Springer
15 years 11 months ago
2004
Springer
A prevailing feature of mobile telephony systems is that the location of a mobile user may be unknown. Therefore, when the system has to establish a call between users, it may nee...