Sciweavers

15644 search results - page 2650 / 3129
» Brittle System Analysis
Sort
View
174
Voted
ICSE
2008
IEEE-ACM
16 years 7 months ago
Security protocols, properties, and their monitoring
This paper examines the suitability and use of runtime verification as means for monitoring security protocols and their properties. In particular, we employ the runtime verificat...
Andreas Bauer 0002, Jan Jürjens
MOBIHOC
2006
ACM
16 years 6 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao
DCC
2001
IEEE
16 years 6 months ago
How to Choose Secret Parameters for RSA-Type Cryptosystems over Elliptic Curves
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
Marc Joye, Jean-Jacques Quisquater, Tsuyoshi Takag...
MOBIHOC
2003
ACM
16 years 6 months ago
Localization from mere connectivity
It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. W...
Yi Shang, Wheeler Ruml, Ying Zhang, Markus P. J. F...
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 4 months ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan
« Prev « First page 2650 / 3129 Last » Next »