448 search results - page 26 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
JCB
2007
14 years 9 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
81
Voted
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
87
Voted
PERCOM
2010
ACM
14 years 8 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
IMC
2003
ACM
15 years 2 months ago
2003
ACM
—This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting c...