121 search results - page 23 / 25 » Approximation algorithms for the shortest total path length ... |
CIC
2004
13 years 8 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
COMPGEOM
2004
ACM
14 years 26 days ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
STACS
2004
Springer
14 years 23 days ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
PAMI
2010
13 years 5 months ago
2010
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
RECOMB
2008
Springer
14 years 7 months ago
2008
Springer
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....