Sciweavers

506 search results - page 74 / 102
» Where Is the Value in a Program Verifier
Sort
View
133
Voted
CASES
2005
ACM
15 years 2 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
122
Voted
TSE
2010
180views more  TSE 2010»
14 years 11 months ago
Aspect-Oriented Race Detection in Java
—In the past, researchers have developed specialized programs to aid programmers in detecting concurrent programming errors such as deadlocks, livelocks, starvation, and data rac...
Eric Bodden, Klaus Havelund
CIKM
2005
Springer
15 years 6 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
113
Voted
PPOPP
2012
ACM
13 years 8 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
105
Voted
ISBI
2008
IEEE
15 years 7 months ago
Automated gland and nuclei segmentation for grading of prostate and breast cancer histopathology
Automated detection and segmentation of nuclear and glandular structures is critical for classification and grading of prostate and breast cancer histopathology. In this paper, w...
Shivang Naik, Scott Doyle, Shannon Agner, Anant Ma...