Sciweavers

359 search results - page 66 / 72
» Multi-state Directed Acyclic Graphs
Sort
View
INFOCOM
2007
IEEE
15 years 5 months ago
Lava: A Reality Check of Network Coding in Peer-to-Peer Live Streaming
—In recent literature, network coding has emerged as a promising information theoretic approach to improve the performance of both peer-to-peer and wireless networks. It has been...
Mea Wang, Baochun Li
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
15 years 5 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 5 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
RECOMB
2007
Springer
15 years 5 months ago
Network Legos: Building Blocks of Cellular Wiring Diagrams
Publicly-available data sets provide detailed and large-scale information on multiple types of molecular interaction networks in a number of model organisms. These multi-modal univ...
T. M. Murali, Corban G. Rivera
CCGRID
2005
IEEE
15 years 5 months ago
Mapping DAG-based applications to multiclusters with background workload
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
Ligang He, Stephen A. Jarvis, Daniel P. Spooner, D...