Sciweavers

4263 search results - page 424 / 853
» Learning without Coding
Sort
View
187
Voted
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 10 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
FAST
2008
15 years 9 months ago
EIO: Error Handling is Occasionally Correct
The reliability of file systems depends in part on how well they propagate errors. We develop a static analysis technique, EDP, that analyzes how file systems and storage device d...
Haryadi S. Gunawi, Cindy Rubio-González, An...
DAC
2005
ACM
15 years 8 months ago
Dynamic reconfiguration with binary translation: breaking the ILP barrier with software compatibility
In this paper we present the impact of dynamically translating any sequence of instructions into combinational logic. The proposed approach combines a reconfigurable architecture ...
Antonio Carlos Schneider Beck, Luigi Carro
CODES
2008
IEEE
15 years 8 months ago
Specification-based compaction of directed tests for functional validation of pipelined processors
Functional validation is a major bottleneck in microprocessor design methodology. Simulation is the widely used method for functional validation using billions of random and biase...
Heon-Mo Koo, Prabhat Mishra
MASCOTS
2007
15 years 8 months ago
Improving the Performance of Passive Network Monitoring Applications using Locality Buffering
—In this paper, we present a novel approach for improving the performance of a large class of CPU and memory intensive passive network monitoring applications, such as intrusion ...
Antonis Papadogiannakis, Demetres Antoniades, Mich...