Sciweavers

105
Voted
COCOON
2006
Springer
15 years 7 months ago
Restricted Mesh Simplification Using Edge Contractions
We consider the problem of simplifying a triangle mesh using edge contractions, under the restriction that the resulting vertices must be a subset of the input set. That is, contr...
Mattias Andersson, Joachim Gudmundsson, Christos L...
FCCM
2004
IEEE
269views VLSI» more  FCCM 2004»
15 years 7 months ago
FPGA Based Network Intrusion Detection using Content Addressable Memories
In this paper, we introduce a novel architecture for a hardware based network intrusion detection system (NIDS). Current software-based NIDS are too compute intensive and can not ...
Long Bu, John A. Chandy
FCCM
2004
IEEE
129views VLSI» more  FCCM 2004»
15 years 7 months ago
Design Patterns for Reconfigurable Computing
It is valuable to identify and catalog design patterns for reconfigurable computing. These design patterns are canonical solutions to common and recurring design challenges which ...
André DeHon, Joshua Adams, Michael DeLorimi...
135
Voted
FCCM
2004
IEEE
133views VLSI» more  FCCM 2004»
15 years 7 months ago
A Methodology for Synthesis of Efficient Intrusion Detection Systems on FPGAs
Intrusion detection for network security is a computation intensive application demanding high system performance. System level design, a relatively unexplored field in this area,...
Zachary K. Baker, Viktor K. Prasanna
COCOON
2006
Springer
15 years 7 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...