Sciweavers

2372 search results - page 154 / 475
» Probabilistic calling context
Sort
View
123
Voted
RECOMB
2003
Springer
16 years 2 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
MOBIHOC
2008
ACM
16 years 2 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu
ATVA
2009
Springer
149views Hardware» more  ATVA 2009»
15 years 9 months ago
A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Systems
In this paper, we describe a decompositional approach to convergence proofs for stochastic hybrid systems given as probabilistic hybrid automata. We focus on a concept called “st...
Jens Oehlerking, Oliver E. Theel
FOCI
2007
IEEE
15 years 8 months ago
Random Hypergraph Models of Learning and Memory in Biomolecular Networks: Shorter-Term Adaptability vs. Longer-Term Persistency
Recent progress in genomics and proteomics makes it possible to understand the biological networks at the systems level. We aim to develop computational models of learning and memo...
Byoung-Tak Zhang
ICDCS
2006
IEEE
15 years 8 months ago
A Semantic Overlay for Self- Peer-to-Peer Publish/Subscribe
Publish/Subscribe systems provide a useful platform for delivering data (events) from publishers to subscribers in an anonymous fashion in distributed networks. In this paper, we ...
Emmanuelle Anceaume, Maria Gradinariu, Ajoy Kumar ...