Sciweavers

1369 search results - page 165 / 274
» A Practical Implementation of the Timing Attack
Sort
View
EWSPT
2001
Springer
15 years 3 months ago
A Mobile Agent Approach to Process-Based Dynamic Adaptation of Complex Software Systems
We describe an approach based upon software process technology to on-the-fly monitoring, redeployment, reconfiguration, and in general dynamic adaptation of distributed software ap...
Giuseppe Valetto, Gail E. Kaiser, Gaurav S. Kc
WISEC
2009
ACM
15 years 6 months ago
Securing network access in wireless sensor networks
In wireless sensor networks, it is critical to restrict the network access only to eligible sensor nodes, while messages from outsiders will not be forwarded in the networks. In t...
Kun Sun, An Liu, Roger Xu, Peng Ning, W. Douglas M...
DC
2010
14 years 11 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic
PVLDB
2010
129views more  PVLDB 2010»
14 years 9 months ago
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
Wook-Shin Han, Jinsoo Lee, Minh-Duc Pham, Jeffrey ...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
14 years 11 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes