Sciweavers

404 search results - page 75 / 81
» Performance Comparison of Secure Comparison Protocols
Sort
View
JSAC
2007
97views more  JSAC 2007»
14 years 9 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
15 years 1 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna
SIGCOMM
2006
ACM
15 years 3 months ago
Minimizing churn in distributed systems
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...
Brighten Godfrey, Scott Shenker, Ion Stoica
AIME
1997
Springer
15 years 1 months ago
A Task-Specific Ontology for the Application and Critiquing of Time-Oriented Clinical Guidelines
: Clinical guidelines reuse existing clinical procedural knowledge while leaving room for flexibility by the care provider applying that knowledge. Guidelines can be viewed as gene...
Yuval Shahar, Silvia Miksch, Peter Johnson
GLOBECOM
2007
IEEE
14 years 9 months ago
Multi-Class QoS in 802.11 Networks Using Gentle Decrease of Multiple Contention Windows
—IEEE 802.11 Distributed Coordination Function (DCF) uses a binary exponential backoff algorithm to arbitrate simultaneous channel access by multiple stations. When a station sen...
Bushra Anjum, Zartash Afzal Uzmi