Sciweavers

2570 search results - page 149 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ICPR
2002
IEEE
16 years 4 months ago
GraphGrep: A Fast and Universal Method for Querying Graphs
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
Rosalba Giugno, Dennis Shasha
111
Voted
EUROPAR
2007
Springer
15 years 7 months ago
Fast and Efficient Total Exchange on Two Clusters
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...
Emmanuel Jeannot, Luiz Angelo Steffenel
113
Voted
IPPS
2007
IEEE
15 years 9 months ago
Fast Failure Detection in a Process Group
Failure detectors represent a very important building block in distributed applications. The speed and the accuracy of the failure detectors is critical to the performance of the ...
Xinjie Li, Monica Brockmeyer
ICIP
2004
IEEE
16 years 5 months ago
Fast alignment of digital images using a lower bound on an entropy metric
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
Mert R. Sabuncu, Peter J. Ramadge
129
Voted
ICIP
2002
IEEE
16 years 5 months ago
Full search content independent block matching based on the fast Fourier transform
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
Mark S. Drew, Steven L. Kilthau, Torsten Möll...