Sciweavers

4009 search results - page 392 / 802
» Clustering on Complex Graphs
Sort
View
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
15 years 8 months ago
Fast Multilevel Transduction on Graphs
The recent years have witnessed a surge of interest in graphbased semi-supervised learning methods. The common denominator of these methods is that the data are represented by the...
Fei Wang, Changshui Zhang
VIP
2003
15 years 8 months ago
On the Structural Algorithm of Filtering Graphs for Layout
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...
Xiaodi Huang, Wei Lai
GD
2008
Springer
15 years 8 months ago
The Binary Stress Model for Graph Drawing
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
Yehuda Koren, Ali Civril
BIOINFORMATICS
2007
83views more  BIOINFORMATICS 2007»
15 years 7 months ago
Exploring biological network structure using exponential random graph models
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
Zachary M. Saul, Vladimir Filkov
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 7 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash