Sciweavers

286 search results - page 17 / 58
» Highly Concurrent Shared Storage
Sort
View
JSAC
2006
172views more  JSAC 2006»
14 years 9 months ago
A Memory-Efficient Parallel String Matching Architecture for High-Speed Intrusion Detection
The ability to inspect both packet headers and payloads to identify attack signatures makes network intrusion detection system (NIDS) a promising approach to protect Internet syste...
Hongbin Lu, Kai Zheng, Bin Liu, Xin Zhang, Y. Liu
ICDAR
2007
IEEE
15 years 4 months ago
Building Compact MQDF Classifier for Off-line Handwritten Chinese Characters by Subspace Distribution Sharing
Quadratic classifier with modified quadratic discriminant function (MQDF) has been successfully applied to recognition of handwritten characters to achieve very good performance. ...
Teng Long, Lianwen Jin
114
Voted
ICDCSW
2002
IEEE
15 years 2 months ago
Efficient Massive Sharing of Content among Peers
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request r...
Peter Triantafillou, Chryssani Xiruhaki, Manolis K...
IEEEPACT
2008
IEEE
15 years 4 months ago
Improving support for locality and fine-grain sharing in chip multiprocessors
Both commercial and scientific workloads benefit from concurrency and exhibit data sharing across threads/processes. The resulting sharing patterns are often fine-grain, with t...
Hemayet Hossain, Sandhya Dwarkadas, Michael C. Hua...
EUROCRYPT
2004
Springer
15 years 3 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer