5169 search results - page 813 / 1034 » Locality approximation using time |
143
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
130
click to vote
CSSC
2008
15 years 4 months ago
2008
The decorrelating property of the discrete wavelet transformation (DWT) appears valuable because one can avoid estimating the correlation structure in the original data space by b...
127
Voted
CN
2006
15 years 4 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
134
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
128
click to vote
IJBC
2008
15 years 4 months ago
2008
Considering trajectory curves, integral of n-dimensional dynamical systems, within the framework of Differential Geometry as curves in Euclidean n-space it will be established in ...