3068 search results - page 144 / 614 » Clustering with Multiple Graphs |
144
click to vote
FPL
2006
Springer
15 years 7 months ago
2006
Springer
Many compute-intensive applications generate single result values by accessing clusters of nearby points in grids of one, two, or more dimensions. Often, the performance of FGPA i...
130
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
163
click to vote
KDD
2008
ACM
2008
ACM
Knowledge discovery of semantic relationships between words using nonparametric bayesian graph model
16 years 4 months ago
We developed a model based on nonparametric Bayesian modeling for automatic discovery of semantic relationships between words taken from a corpus. It is aimed at discovering seman...
138
click to vote
PC
2010
15 years 2 months ago
2010
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
134
click to vote
IADIS
2004
15 years 5 months ago
2004
Many real world datasets are represented in the form of graphs. The classical graph properties found in the data, like cliques or independent sets, can reveal new interesting info...