Sciweavers

8933 search results - page 1679 / 1787
» Usability over time
Sort
View
138
Voted
COMPGEOM
1992
ACM
15 years 8 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
SPAA
1990
ACM
15 years 8 months ago
Hardware Speedups in Long Integer Multiplication
We present various experiments in Hardware/Software designtradeoffs met in speeding up long integer multiplications. This work spans over a year, with more than 12 different hardw...
Mark Shand, Patrice Bertin, Jean Vuillemin
156
Voted
AIME
2009
Springer
15 years 8 months ago
Data-Efficient Information-Theoretic Test Selection
We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimate...
Marianne Mueller, Rómer Rosales, Harald Ste...
145
Voted
ANCS
2007
ACM
15 years 8 months ago
Compiling PCRE to FPGA for accelerating SNORT IDS
Deep Payload Inspection systems like SNORT and BRO utilize regular expression for their rules due to their high expressibility and compactness. The SNORT IDS system uses the PCRE ...
Abhishek Mitra, Walid A. Najjar, Laxmi N. Bhuyan
ISCA
2010
IEEE
199views Hardware» more  ISCA 2010»
15 years 8 months ago
Use ECP, not ECC, for hard failures in resistive memories
As leakage and other charge storage limitations begin to impair the scalability of DRAM, non-volatile resistive memories are being developed as a potential replacement. Unfortunat...
Stuart E. Schechter, Gabriel H. Loh, Karin Straus,...
« Prev « First page 1679 / 1787 Last » Next »