779 search results - page 57 / 156 » Algorithms for the Sample Mean of Graphs |
171
click to vote
BMCBI
2011
14 years 11 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...
181
click to vote
SMA
2009
ACM
15 years 11 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
129
click to vote
VLSID
1996
IEEE
15 years 8 months ago
1996
IEEE
Existing systolic architectures for the LMS algorithm with delayed coeficient adaptation have large adaptation delay and hence degraded convergence behaviour. This paper presents ...
134
click to vote
QEST
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper provides an experimental study of the efficiency of simulation-based model-checking algorithms for continuous-time Markov chains by comparing: MRMC – the only tool t...
120
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
When the number of labeled examples is limited, traditional supervised feature selection techniques often fail due to sample selection bias or unrepresentative sample problem. To ...