Sciweavers

5171 search results - page 161 / 1035
» Deterministic Parallel Processing
Sort
View
AFRICACRYPT
2008
Springer
13 years 10 months ago
An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees
Proof-of-work schemes are economic measures to deter denial-of-service attacks: service requesters compute moderately hard functions the results of which are easy to check by the ...
Fabien Coelho
PVLDB
2010
118views more  PVLDB 2010»
13 years 6 months ago
Ten Thousand SQLs: Parallel Keyword Queries Computing
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
Lu Qin, Jefferey Yu, Lijun Chang
IPPS
2010
IEEE
13 years 6 months ago
Head-body partitioned string matching for Deep Packet Inspection with scalable and attack-resilient performance
Abstract--Dictionary-based string matching (DBSM) is a critical component of Deep Packet Inspection (DPI), where thousands of malicious patterns are matched against high-bandwidth ...
Yi-Hua E. Yang, Viktor K. Prasanna, Chenqian Jiang
CLUSTER
2006
IEEE
14 years 2 months ago
A Parallel Algorithm for the Solution of the Deconvolution Problem on Heterogeneous Networks
In this work we present a parallel algorithm for the solution of a least squares problem with structured matrices. This problem arises in many applications mainly related to digit...
Pedro Alonso, Antonio M. Vidal, Alexey L. Lastovet...
TCS
2010
13 years 6 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre