1722 search results - page 76 / 345 » On the sample mean of graphs |
154
click to vote
ICCS
2005
Springer
15 years 11 months ago
2005
Springer
A main feature of many logics used in computer science is a means to express quantification. Usually, syntactical devices like variables and quantifiers are used for this purpose...
135
click to vote
UML
2001
Springer
15 years 10 months ago
2001
Springer
We present a real-time execution semantics for UML activity graphs that is intended for workflow modelling. The semantics is defined in terms of execution algorithms that define...
153
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
We investigate a method using support vector machines (SVMs) with walk-based graph kernels for high-level feature extraction from images. In this method, each image is first segme...
164
click to vote
DAGSTUHL
2001
15 years 7 months ago
2001
To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture an...
156
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...