534 search results - page 59 / 107 » Tight approximation algorithm for connectivity augmentation ... |
SODA
1998
ACM
13 years 9 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
FSTTCS
2003
Springer
14 years 25 days ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
PG
2002
IEEE
14 years 16 days ago
2002
IEEE
An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization al...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
AAIM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Pricing arithmetic average options continues to intrigue researchers in the field of financial engineering. Since there is no analytical solution for this problem until...