Sciweavers

275 search results - page 23 / 55
» Using Randomized Caches in Probabilistic Real-Time Systems
Sort
View
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
13 years 6 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
CSFW
2002
IEEE
14 years 18 days ago
Probabilistic Analysis of Anonymity
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of g...
Vitaly Shmatikov
TPDS
2010
135views more  TPDS 2010»
13 years 6 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
MICCAI
2010
Springer
13 years 6 months ago
Detecting Brain Activation in fMRI Using Group Random Walker
Due to the complex noise structure of functional magnetic resonance imaging (fMRI) data, methods that rely on information within a single subject often results in unsatisfactory fu...
Bernard Ng, Ghassan Hamarneh, Rafeef Abugharbieh
WWW
2003
ACM
14 years 8 months ago
Efficient URL caching for world wide web crawling
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
Andrei Z. Broder, Marc Najork, Janet L. Wiener