Sciweavers

244 search results - page 15 / 49
» Fast Set Intersection in Memory
Sort
View
ICCAD
2004
IEEE
139views Hardware» more  ICCAD 2004»
14 years 5 months ago
Fast simulation of VLSI interconnects
This paper introduces an efficient and accurate interconnect simulation technique. A new formulation for typical VLSI interconnect structures is proposed which, in addition to pr...
Jitesh Jain, Cheng-Kok Koh, Venkataramanan Balakri...
USENIX
1990
13 years 10 months ago
Why Aren't Operating Systems Getting Faster As Fast as Hardware?
This paper evaluates several hardware platforms and operating systems using a set of benchmarks that stress kernel entry/exit, file systems, and other things related to operating ...
John K. Ousterhout
CGF
2010
147views more  CGF 2010»
13 years 9 months ago
Resampling Strategies for Deforming MLS Surfaces
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
Joao Paulo Gois, Gustavo C. Buscaglia
TVLSI
2008
106views more  TVLSI 2008»
13 years 8 months ago
New Non-Volatile Memory Structures for FPGA Architectures
A new set of programmable elements (PEs) using a new non-volatile device for use with routing switches and logical elements within a field-programmable gate array (FPGA) is describ...
David Choi, Kyu Choi, John D. Villasenor
ANCS
2005
ACM
14 years 2 months ago
Fast and scalable pattern matching for content filtering
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 packe...
Sarang Dharmapurikar, John W. Lockwood