Sciweavers

373 search results - page 53 / 75
» On Deterministic Approximation of DNF
Sort
View
ANCS
2009
ACM
13 years 7 months ago
A NFA-based programmable regular expression match engine
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
Derek Pao
SIAMREV
2010
132views more  SIAMREV 2010»
13 years 4 months ago
A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
In this paper we propose and analyze a Stochastic-Collocation method to solve elliptic Partial Differential Equations with random coefficients and forcing terms (input data of the...
Ivo Babuska, Fabio Nobile, Raúl Tempone
ICNP
2007
IEEE
14 years 4 months ago
A Probabilistic Coverage Protocol for Wireless Sensor Networks
—We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing model...
Mohamed Hefeeda, Hossein Ahmadi
ICCS
2007
Springer
14 years 3 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
14 years 2 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...