Sciweavers

2057 search results - page 357 / 412
» Distributed Secure Systems: Then and Now
Sort
View
AGENTS
2001
Springer
14 years 1 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
14 years 13 days 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
SIGMOD
2009
ACM
153views Database» more  SIGMOD 2009»
14 years 9 months ago
ELMR: lightweight mobile health records
Cell phones are increasingly being used as common clients for a wide suite of distributed, database-centric healthcare applications in developing regions. This is particularly tru...
Arvind Kumar, Amey Purandare, Jay Chen, Arthur Mea...
RSA
2000
170views more  RSA 2000»
13 years 8 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
IPPS
2007
IEEE
14 years 3 months ago
Pseudo Trust: Zero-Knowledge Based Authentication in Anonymous Peer-to-Peer Protocols
Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer’s ide...
Li Lu, Jinsong Han, Lei Hu, Jinpeng Huai, Yunhao L...