Sciweavers

1007 search results - page 21 / 202
» An approach for matching communication patterns in parallel ...
Sort
View
APIN
2000
103views more  APIN 2000»
14 years 11 months ago
Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...
Brian J. Ross
SBACPAD
2005
IEEE
110views Hardware» more  SBACPAD 2005»
15 years 5 months ago
Portable checkpointing and communication for BSP applications on dynamic heterogeneous Grid environments
Executing long-running parallel applications in Opportunistic Grid environments composed of heterogeneous, shared user workstations, is a daunting task. Machines may fail, become ...
Raphael Y. de Camargo, Fabio Kon, Alfredo Goldman
SIGCOMM
2006
ACM
15 years 5 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
IFIPPACT
1994
15 years 26 days ago
Exploiting the Parallelism Exposed by Partial Evaluation
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
Rajeev J. Surati, Andrew A. Berlin
91
Voted
SPIRE
2010
Springer
14 years 10 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura