Sciweavers

1297 search results - page 167 / 260
» fews 2007
Sort
View
WDAG
2007
Springer
103views Algorithms» more  WDAG 2007»
15 years 3 months ago
Probabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocol...
Michael G. Merideth, Michael K. Reiter
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 3 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
WEBI
2007
Springer
15 years 3 months ago
K-SVMeans: A Hybrid Clustering Algorithm for Multi-Type Interrelated Datasets
Identification of distinct clusters of documents in text collections has traditionally been addressed by making the assumption that the data instances can only be represented by ...
Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee G...
WISA
2007
Springer
15 years 3 months ago
A Compositional Multiple Policies Operating System Security Model
Multilevel security policies aim at only confidentiality assurance, with less consideration on integrity assurance and weakness in expressing channel control policies. Besides, the...
Lei Xia, Wei Huang, Hao Huang
WISTP
2007
Springer
15 years 3 months ago
A New Resilient Key Management Protocol for Wireless Sensor Networks
Wireless Sensor Networks (WSN) security is an important issue which has been investigated by researchers for few years. The most fundamental security problem in WSN is key manageme...
Chakib Bekara, Maryline Laurent-Maknavicius