2814 search results - page 230 / 563 » Competitive Analysis of Distributed Algorithms |
122
Voted
CCGRID
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining appro...
85
Voted
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
114
Voted
PODC
2010
ACM
15 years 4 months ago
2010
ACM
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
140
click to vote
SPAA
1996
ACM
15 years 4 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...