Sciweavers

3750 search results - page 140 / 750
» Timed Automata Patterns
Sort
View
126
Voted
GLOBECOM
2010
IEEE
15 years 17 days ago
Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching
Multi-string matching is a key technique for implementing network security applications like Network Intrusion Detection Systems (NIDS) and anti-virus scanners. Existing DFA-based ...
Yi Tang, Junchen Jiang, Xiaofei Wang, Bin Liu, Yan...
154
Voted
GLOBECOM
2010
IEEE
14 years 12 months ago
Skip Finite Automaton: A Content Scanning Engine to Secure Enterprise Networks
Abstract--Today's file sharing networks are creating potential security problems to enterprise networks, i.e., the leakage of confidential documents. In order to prevent such ...
Junchen Jiang, Yi Tang, Bin Liu, Yang Xu, Xiaofei ...
MANSCI
2010
73views more  MANSCI 2010»
14 years 9 months ago
Timing of Effort and Reward: Three-Sided Moral Hazard in a Continuous-Time Model
Businesses often need to face the problem of providing incentives for employees to work together effectively on projects that develop over time. This paper derives the optimal con...
Jun Yang
106
Voted
IPPS
1997
IEEE
15 years 6 months ago
Time-Stamping Algorithms for Parallelization of Loops at Run-Time
In this paper, we present two new run-time algorithms for the parallelization of loops that have indirect access patterns. The algorithms can handle any type of loop-carried depen...
Cheng-Zhong Xu, Vipin Chaudhary
102
Voted
MCS
2008
Springer
15 years 2 months ago
Simulation of Brownian motion at first-passage times
We show how to simulate Brownian motion not on a regular time grid, but on a regular spatial grid. That is, when it first hits points in Z for some > 0. Central to our method ...
Zaeem A. Burq, Owen D. Jones