Sciweavers

5115 search results - page 985 / 1023
» On Randomized Lanczos Algorithms
Sort
View
135
Voted
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 9 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
ICIAR
2009
Springer
15 years 9 months ago
Implicit Active-Contouring with MRF
In this paper, we present a new image segmentation method based on energy minimization for iteratively evolving an implicit active contour. Methods for active contour evolution is ...
Pierre-Marc Jodoin, Venkatesh Saligrama, Janusz Ko...
135
Voted
SIGMETRICS
2009
ACM
165views Hardware» more  SIGMETRICS 2009»
15 years 9 months ago
Understanding intrinsic characteristics and system implications of flash memory based solid state drives
Flash Memory based Solid State Drive (SSD) has been called a “pivotal technology” that could revolutionize data storage systems. Since SSD shares a common interface with the t...
Feng Chen, David A. Koufaty, Xiaodong Zhang
CGO
2008
IEEE
15 years 9 months ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout
DSN
2008
IEEE
15 years 9 months ago
Probabilistic quorum systems in wireless ad hoc networks
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
Roy Friedman, Gabriel Kliot, Chen Avin