Sciweavers

12272 search results - page 348 / 2455
» Experimental program analysis
Sort
View
AADEBUG
1997
Springer
15 years 11 months ago
Backwards-Compatible Bounds Checking for Arrays and Pointers in C Programs
This paper presents a new approach to enforcing array bounds and pointer checking in the C language. Checking is rigorous in the sense that the result of pointer arithmetic must r...
Richard W. M. Jones, Paul H. J. Kelly
COMPSAC
2007
IEEE
15 years 10 months ago
Piping Classification to Metamorphic Testing: An Empirical Study towards Better Effectiveness for the Identification of Failures
Mesh simplification is a mainstream technique to render graphics responsively in modern graphical software. However, the graphical nature of the output poses a test oracle problem...
W. K. Chan, Jeffrey C. F. Ho, T. H. Tse
ECML
2006
Springer
15 years 8 months ago
Efficient Large Scale Linear Programming Support Vector Machines
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
Suvrit Sra
ISMB
1996
15 years 8 months ago
Finding Genes in DNA Using Decision Trees and Dynamic Programming
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...
Steven Salzberg, Xin Chen, John Henderson, Kenneth...
TCBB
2010
114views more  TCBB 2010»
15 years 5 months ago
Cache-Oblivious Dynamic Programming for Bioinformatics
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
Rezaul Alam Chowdhury, Hai-son Le, Vijaya Ramachan...