4926 search results - page 343 / 986 » Two Graph Algorithms On an Associative Computing Model |
133
click to vote
ICPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
154
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
148
click to vote
AAAI
2006
15 years 6 months ago
2006
With increasing deployment of systems involving multiple coordinating agents, there is a growing need for diagnosing coordination failures in such systems. Previous work presented...
125
click to vote
ASPDAC
2006
ACM
15 years 10 months ago
2006
ACM
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
148
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...