Sciweavers

5658 search results - page 1019 / 1132
» An Efficient Counting Network
Sort
View
CP
2004
Springer
15 years 10 months ago
Concurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
Roie Zivan, Amnon Meisels
CIKM
2006
Springer
15 years 10 months ago
Distributed spatio-temporal similarity search
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
Demetrios Zeinalipour-Yazti, Song Lin, Dimitrios G...
FCCM
2004
IEEE
163views VLSI» more  FCCM 2004»
15 years 10 months ago
Implementation Results of Bloom Filters for String Matching
Network Intrusion Detection and Prevention Systems (IDPS) use string matching to scan Internet packets for malicious content. Bloom filters offer a mechanism to search for a large...
Michael Attig, Sarang Dharmapurikar, John W. Lockw...
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
CCS
2006
ACM
15 years 10 months ago
Optimizing BGP security by exploiting path stability
The Border Gateway Protocol (BGP) is the de facto interdomain routing protocol on the Internet. While the serious vulnerabilities of BGP are well known, no security solution has b...
Kevin R. B. Butler, Patrick McDaniel, William Aiel...
« Prev « First page 1019 / 1132 Last » Next »