Sciweavers

174 search results - page 17 / 35
» Using Interaction Costs for Microarchitectural Bottleneck An...
Sort
View
JSAC
2006
163views more  JSAC 2006»
13 years 7 months ago
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
Sarang Dharmapurikar, John W. Lockwood
COMPSAC
2008
IEEE
14 years 1 months ago
Error Modeling in Dependable Component-Based Systems
Component-Based Development (CBD) of software, with its successes in enterprise computing, has the promise of being a good development model due to its cost effectiveness and pote...
Hüseyin Aysan, Sasikumar Punnekkat, Radu Dobr...
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
14 years 23 days ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...
INFOCOM
2003
IEEE
14 years 20 days ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
KBSE
1998
IEEE
13 years 11 months ago
Specification-based Browsing of Software Component Libraries
Specification-based retrieval provides exact contentoriented access to component libraries but requires too much deductive power. Specification-based browsing evades this bottlene...
B. Fischer