Sciweavers

306 search results - page 54 / 62
» Fault-Tolerant Computation in the Full Information Model
Sort
View
MOBIHOC
2007
ACM
14 years 8 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
SIGCOMM
2009
ACM
14 years 3 months ago
Economic issues in shared infrastructures
We define some interesting incentive issues that arise in the management of virtual infrastructures. We demonstrate that participants’ decisions about the quantities of infrast...
Costas Courcoubetis, Richard R. Weber
QEST
2007
IEEE
14 years 3 months ago
Qualitative Logics and Equivalences for Probabilistic Systems
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
Luca de Alfaro, Krishnendu Chatterjee, Marco Faell...
CCS
2006
ACM
14 years 21 days ago
Hot or not: revealing hidden services by their clock skew
Location-hidden services, as offered by anonymity systems such as Tor, allow servers to be operated under a pseudonym. As Tor is an overlay network, servers hosting hidden service...
Steven J. Murdoch
SIGIR
2005
ACM
14 years 2 months ago
Orthogonal locality preserving indexing
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He