Sciweavers

1389 search results - page 121 / 278
» Parallel Algorithms for Treewidth Two
Sort
View
ECCV
2010
Springer
15 years 3 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
IEEEHPCS
2010
14 years 8 months ago
An experimental study of greedy routing algorithms
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
Stavros Athanassopoulos, Christos Kaklamanis, Ilia...
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
15 years 4 months ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer
IJAR
2007
69views more  IJAR 2007»
14 years 10 months ago
Racing algorithms for conditional independence inference
In this article, we consider the computational aspects of deciding whether a conditional independence statement t is implied by a list of conditional independence statements L usi...
Remco R. Bouckaert, Milan Studený
ERSA
2010
137views Hardware» more  ERSA 2010»
14 years 7 months ago
An Automated Scheduling and Partitioning Algorithm for Scalable Reconfigurable Computing Systems
As reconfigurable computing (RC) platforms are becoming increasingly large-scale and heterogeneous, efficiently scheduling and partitioning applications on these platforms is a gro...
Casey Reardon, Alan D. George, Greg Stitt, Herman ...