Sciweavers

442 search results - page 87 / 89
» A Distributed Range Assignment Protocol
Sort
View
PRDC
2002
IEEE
14 years 7 days ago
Caveat Emptor: Making Grid Services Dependable from the Client Side
Grid computing relies on fragile partnerships. Clients with hundreds or even thousands of pending service requests must seek out and form temporary alliances with remote servers e...
Miron Livny, Douglas Thain
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 11 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ACSC
2004
IEEE
13 years 11 months ago
Kerberos Assisted Authentication in Mobile Ad-hoc Networks
An ad-hoc network comprises mobile nodes that cooperate with each other using wireless connections to route both data and control packets within the network. As the low transmissi...
Asad Amir Pirzada, Chris McDonald
FASE
2004
Springer
13 years 11 months ago
Specification and Analysis of Real-Time Systems Using Real-Time Maude
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...
Peter Csaba Ölveczky, José Meseguer
BMCBI
2010
132views more  BMCBI 2010»
13 years 7 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...