1830 search results - page 88 / 366 » Workshop on Graph Computation Models |
130
click to vote
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
134
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We propose in this paper a face authentication method based on a similarity measure. The SIFT descriptor is used to define some interest keypoints characterized by an invariant pa...
138
click to vote
SRDS
1998
IEEE
15 years 8 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
138
click to vote
ESA
2000
Springer
15 years 8 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
187
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...