4926 search results - page 161 / 986 » Two Graph Algorithms On an Associative Computing Model |
136
Voted
DIS
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
161
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper we propose a new clustering algorithm which combines the FCM clustering algorithm with the supervised learning normal mixture model; we call the algorithm as the FCM...
164
Voted
SPE
2008
15 years 4 months ago
2008
composed of various graphs linked together by relations of abstraction/refinement. The new structure is useful for representing information that can be described at t levels of abs...
148
click to vote
PDP
2006
IEEE
15 years 11 months ago
2006
IEEE
— The Parallel Resource-Optimal (PRO) computation model was introduced by Gebremedhin et al. [2002] as a framework for the design and analysis of efficient parallel algorithms. ...
152
click to vote
WDAG
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...