6542 search results - page 184 / 1309 » The tao of parallelism in algorithms |
163
click to vote
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
197
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
200
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: MapReduce is a parallel framework that has been used effectively to design largescale parallel applications for large computing clusters. In this paper, we evaluate th...
149
click to vote
ESA
2007
Springer
16 years 23 days ago
2007
Springer
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio de
178
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Dynamic Probabilistic Networks (DPNs) are exploited for modelling the temporal relationships among a set of different object temporal events in the scene for a coherent and robust...