Sciweavers

1206 search results - page 48 / 242
» Arc-Flags in Dynamic Graphs
Sort
View
RSA
2008
123views more  RSA 2008»
13 years 9 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
BIRTHDAY
2008
Springer
13 years 12 months ago
Graph-Based Design and Analysis of Dynamic Software Architectures
We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented i...
Roberto Bruni, Antonio Bucchiarone, Stefania Gnesi...
ICASSP
2011
IEEE
13 years 1 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
FOCM
2011
113views more  FOCM 2011»
13 years 4 months ago
Finite Resolution Dynamics
We develop a new mathematical model for describing a dynamical system at limited resolution (or finite scale), and we give precise meaning to the notion of a dynamical system havi...
Stefano Luzzatto, Pawel Pilarczyk
IPPS
2007
IEEE
14 years 4 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis