334 search results - page 48 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
ISPA
2005
Springer
15 years 3 months ago
2005
Springer
The way conventional Ethernet is used today differs in two aspects from how dedicated system area networks are used. Firstly, dedicated system area networks are lossless and only d...
108
click to vote
PAMI
2010
14 years 8 months ago
2010
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
102
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
137
click to vote
ISCA
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...