Sciweavers

229 search results - page 19 / 46
» How Efficient Can Memory Checking Be
Sort
View
AMAI
2010
Springer
13 years 5 months ago
Efficient approximate verification of B and Z models via symmetry markers
Abstract We present a new approximate verification technique for falsifying the invariants of B models. The technique employs symmetry of B models induced by the use of deferred se...
Michael Leuschel, Thierry Massart
CSCLP
2006
Springer
13 years 11 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
IJCV
2002
227views more  IJCV 2002»
13 years 7 months ago
Calculating Dense Disparity Maps from Color Stereo Images, an Efficient Implementation
Abstract-- This paper presents an efficient implementation for correlation based stereo. Research in this area can roughly be divided in two classes: improving accuracy regardless ...
Karsten Mühlmann, Dennis Maier, Jürgen H...
TJS
2008
95views more  TJS 2008»
13 years 7 months ago
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications
Multiple memory models have been proposed to capture the effects of memory hierarchy culminating in the I-O model of Aggarwal and Vitter [?]. More than a decade of architectural a...
Akshat Verma, Sandeep Sen
TIT
2010
124views Education» more  TIT 2010»
13 years 2 months ago
Storage coding for wear leveling in flash memories
NAND flash memories are currently the most widely used type of flash memories. In a NAND flash memory, although a cell block consists of many pages, to rewrite one page, the whole ...
Anxiao Jiang, Robert Mateescu, Eitan Yaakobi, Jeho...