9532 search results - page 386 / 1907 » Logic, Graphs, and Algorithms |
190
click to vote
PVLDB
2010
15 years 5 months ago
2010
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
208
click to vote
PVLDB
2010
15 years 5 months ago
2010
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
247
click to vote
OL
2011
15 years 1 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
163
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper presents a general framework for agglomerative hierarchical clustering based on graphs. Specifying an inter-cluster similarity measure, a subgraph of the similarity gra...
187
click to vote
ARC
2010
Springer
15 years 10 months ago
2010
Springer
Coarse Grained Reconfigurable Array (CGRA) architectures give high throughput and data reuse for regular algorithms while providing flexibility to execute multiple algorithms on th...