1923 search results - page 60 / 385 » Modeling Complexity in Secure Distributed Computing |
100
click to vote
AUTONOMICS
2008
ACM
14 years 11 months ago
2008
ACM
Ubiquitous computing and communication environments connect systems and people in unprecedented ways, but also fundamentally challenge the mindset of traditional systems engineeri...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...
103
click to vote
IFM
2010
Springer
14 years 8 months ago
2010
Springer
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 ...
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
We propose an algorithm for texture segmentation based on a divide-and-conquerstrategy of statistical modeling.Selectedsets of Gaussianclusters,estimated via ExpectationMaximizati...