4926 search results - page 90 / 986 » Two Graph Algorithms On an Associative Computing Model |
108
click to vote
DATE
2007
IEEE
15 years 8 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...
121
click to vote
SRDS
1998
IEEE
15 years 6 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...
137
click to vote
KDD
2005
ACM
16 years 2 months ago
2005
ACM
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...
GD
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
123
click to vote
ESA
2000
Springer
15 years 6 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 ...