Sciweavers

3068 search results - page 114 / 614
» Clustering with Multiple Graphs
Sort
View
154
Voted
PKDD
2007
Springer
132views Data Mining» more  PKDD 2007»
15 years 10 months ago
An Algorithm to Find Overlapping Community Structure in Networks
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
Steve Gregory
PDP
2007
IEEE
15 years 10 months ago
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
Andreas Beckmann, Jorg Keller
129
Voted
FPGA
1995
ACM
107views FPGA» more  FPGA 1995»
15 years 7 months ago
Multi-way System Partitioning into a Single Type or Multiple Types of FPGAs
This paper considers the problem of partitioning a circuit into a collection of subcircuits, such that each subcircuit is feasible for some device from an FPGA library, and the to...
Dennis J.-H. Huang, Andrew B. Kahng
248
Voted
BMCBI
2007
182views more  BMCBI 2007»
15 years 3 months ago
EDISA: extracting biclusters from multiple time-series of gene expression profiles
Background: Cells dynamically adapt their gene expression patterns in response to various stimuli. This response is orchestrated into a number of gene expression modules consistin...
Jochen Supper, Martin Strauch, Dierk Wanke, Klaus ...
123
Voted
LWA
2007
15 years 5 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst