1951 search results - page 159 / 391 » An algorithm for improving graph partitions |
159
click to vote
ICIP
2000
IEEE
16 years 6 months ago
2000
IEEE
We combine multiple description (MD) quantization, entropy coding, and data partitioning to improve the error resiliency of images over varying packet loss channels. Our proposed ...
137
click to vote
GBRPR
2009
Springer
15 years 11 months ago
2009
Springer
A universal data model, named DG, is introduced to handle vectorized data uniformly during the whole recognition process. The model supports low level graph algorithms as well as h...
141
click to vote
ESANN
2007
15 years 6 months ago
2007
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
144
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
The web graph follows the power law distribution and has a hierarchy structure. But neither the PageRank algorithm nor any of its improvements leverage these attributes. In this p...
147
click to vote
IPTPS
2004
Springer
15 years 10 months ago
2004
Springer
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...