Sciweavers

203 search results - page 36 / 41
» Modal Expressiveness of Graph Properties
Sort
View
MFCS
1991
Springer
13 years 11 months ago
CCS Dynamic Bisimulation is Progressing
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
Ugo Montanari, Vladimiro Sassone
NIPS
2004
13 years 8 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
FSTTCS
2009
Springer
14 years 2 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
PLDI
2011
ACM
12 years 10 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
BMCBI
2010
154views more  BMCBI 2010»
13 years 4 months ago
Knowledge-based matrix factorization temporally resolves the cellular responses to IL-6 stimulation
Background: External stimulations of cells by hormones, cytokines or growth factors activate signal transduction pathways that subsequently induce a re-arrangement of cellular gen...
Andreas Kowarsch, Florian Blöchl, Sebastian B...