Sciweavers

420 search results - page 40 / 84
» Generating random regular graphs
Sort
View
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 6 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
WG
1993
Springer
13 years 12 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
BC
1998
118views more  BC 1998»
13 years 7 months ago
A cross-interval spike train analysis: the correlation between spike generation and temporal integration of doublets
Abstract. A stochastic spike train analysis technique is introduced to reveal the correlation between the firing of the next spike and the temporal integration period of two conse...
David C. Tam
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 11 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
BIBE
2006
IEEE
160views Bioinformatics» more  BIBE 2006»
14 years 1 months ago
Methods for Random Modularization of Biological Networks
— Biological networks are formalized summaries of our knowledge about interactions among biological system components, like genes, proteins, or metabolites. From their global top...
Zachary M. Saul, Vladimir Filkov