Sciweavers

229 search results - page 40 / 46
» How Efficient Can Memory Checking Be
Sort
View
ICSM
2007
IEEE
14 years 1 months ago
Indexing Noncrashing Failures: A Dynamic Program Slicing-Based Approach
Recent software systems usually feature an automated failure reporting component, with which a huge number of failures are collected from software end-users. With a proper support...
Xiangyu Zhang Chao Liu, Yu Zhang, Jiawei Han, Bhar...
IWPC
2000
IEEE
14 years 15 hour ago
Automated Quality Analysis of Component Software for Embedded Systems
The Java programming language has gained increasing importance for the development of embedded systems. To be cost efficient, such systems have to cope with significant hardware...
Jens H. Jahnke, Jörg Niere, Jörg P. Wads...
IADIS
2003
13 years 9 months ago
Informatization and E-Business Model Application for Distributed Data Mining Using Mobile Agents
Distributed data mining (DDM) is the semi-automatic pattern extraction of distributed data sources. The next generation of the data mining studies will be distributed data mining ...
Ezendu Ifeanyi Ariwa, Mohamed B. Senousy, Mohamed ...
VIS
2004
IEEE
186views Visualization» more  VIS 2004»
14 years 8 months ago
Hardware-Accelerated Adaptive EWA Volume Splatting
We present a hardware-accelerated adaptive EWA volume splatting algorithm. EWA splatting combines a Gaussian reconstruction kernel with a low-pass image filter for high image qual...
Wei Chen, Liu Ren, Matthias Zwicker, Hanspeter Pfi...
POPL
2003
ACM
14 years 8 months ago
Static prediction of heap space usage for first-order functional programs
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
Martin Hofmann, Steffen Jost