4926 search results - page 79 / 986 » Two Graph Algorithms On an Associative Computing Model |
122
Voted
TSP
2010
14 years 9 months ago
2010
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
100
click to vote
ICPP
1999
IEEE
15 years 6 months ago
1999
IEEE
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of inter...
117
click to vote
SDM
2010
SIAM
15 years 3 months ago
2010
SIAM
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
97
Voted
GMP
2002
IEEE
15 years 7 months ago
2002
IEEE
We present an algorithm for computing Minkowski sums among surfaces of revolution and surfaces of linear extrusion, generated by slope-monotone closed curves. The special structur...
131
click to vote
ACCV
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...