712 search results - page 70 / 143 » On Spectral Graph Drawing |
159
click to vote
FCS
2009
15 years 4 months ago
2009
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
166
click to vote
MICCAI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Image segmentation algorithms derived from spectral clustering analysis rely on the eigenvectors of the Laplacian of a weighted graph obtained from the image. The NCut cr...
152
click to vote
PAKDD
2004
ACM
15 years 11 months ago
2004
ACM
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
140
click to vote
RSA
2008
15 years 5 months ago
2008
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
140
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract— A core challenge in probabilistic mapping is to extract meaningful uncertainty information from data registration methods. While this has been investigated in ICP-based...