Sciweavers

644 search results - page 71 / 129
» A topological characterization of weakness
Sort
View
CORR
2011
Springer
149views Education» more  CORR 2011»
14 years 6 months ago
Solving k-Set Agreement with Stable Skeleton Graphs
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
Martin Biely, Peter Robinson, Ulrich Schmid
MOBICOM
2003
ACM
15 years 5 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas
BMCBI
2008
146views more  BMCBI 2008»
14 years 12 months ago
Rank-based edge reconstruction for scale-free genetic regulatory networks
Background: The reconstruction of genetic regulatory networks from microarray gene expression data has been a challenging task in bioinformatics. Various approaches to this proble...
Guanrao Chen, Peter Larsen, Eyad Almasri, Yang Dai
ML
1998
ACM
14 years 11 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
IJBIS
2010
82views more  IJBIS 2010»
14 years 9 months ago
Simulation discounted cash flow valuation for internet companies
Discounted cash flow (DCF) is the most accepted approach for company valuation. It is well grounded in theory and practice. However, the DCF approach, which is commonly used for t...
Maged Ali, Ramzi El-Haddadeh, Tillal Eldabi, Ebrah...