1599 search results - page 238 / 320 » Probabilistic Analysis of Anonymity |
TCS
2002
13 years 7 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
TSMC
2002
13 years 7 months ago
2002
Abstract--We present the STack ARchitecture (STAR) automaton. It is a fixed structure, multiaction, reward-penalty learning automaton, characterized by a star-shaped state transiti...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— A core challenge in probabilistic mapping is to extract meaningful uncertainty information from data registration methods. While this has been investigated in ICP-based...
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
—This paper proposes a probabilistic technique that enables a node to estimate the number of its neighbors that fulfill certain criteria. The technique does not require any a pr...