1039 search results - page 102 / 208 » Kernels and Regularization on Graphs |
99
Voted
JGAA
2007
15 years 19 days ago
2007
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principl...
127
click to vote
RSA
2010
14 years 11 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
128
click to vote
CG
2004
Springer
15 years 18 days ago
2004
Springer
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
133
Voted
BMCBI
2011
14 years 7 months ago
2011
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
130
click to vote
ALGORITHMICA
2008
15 years 27 days ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...