Sciweavers

2852 search results - page 371 / 571
» High Performance Architectures and Compilers
Sort
View
AINA
2006
IEEE
15 years 10 months ago
Efficient Packet Matching for Gigabit Network Intrusion Detection using TCAMs
Ternary content-addressable memories (TCAMs) have gained wide acceptance in the industry for storing and searching patterns in routers. But two important problems block the way to...
Ming Gao, Kenong Zhang, Jiahua Lu
DAC
1996
ACM
15 years 9 months ago
Computing Parametric Yield Adaptively Using Local Linear Models
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
Mien Li, Linda S. Milor
136
Voted
DAC
1994
ACM
15 years 8 months ago
Clock Grouping: A Low Cost DFT Methodology for Delay Testing
A low overhead DFT technique, called clock-grouping, for delay testing of sequential synchronous circuits is presented. The proposed technique increases robust path delay fault co...
Wen-Chang Fang, Sandeep K. Gupta
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 4 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
171
Voted
INFOCOM
2005
IEEE
15 years 10 months ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas