Sciweavers

2778 search results - page 24 / 556
» Limit complexities revisited
Sort
View
IFIP
2005
Springer
15 years 3 months ago
Probable Innocence Revisited
In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze crit...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
15 years 3 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
ICICS
2004
Springer
15 years 3 months ago
Adaptive-CCA on OpenPGP Revisited
E-mail system has become one of the most important and popular Internet services. Instead of using traditional surface mail, we have the alternative of employing e-mail system whic...
Hsi-Chung Lin, Sung-Ming Yen, Guan-Ting Chen
WCRE
2002
IEEE
15 years 2 months ago
Disassembly of Executable Code Revisited
Machine code disassembly routines form a fundamental component of software systems that statically analyze or modify executable programs. The task of disassembly is complicated by...
Benjamin Schwarz, Saumya K. Debray, Gregory R. And...
RTA
2010
Springer
15 years 1 months ago
Infinitary Rewriting: Foundations Revisited
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
Stefan Kahrs