Sciweavers

523 search results - page 26 / 105
» Symbolic Test Selection Based on Approximate Analysis
Sort
View
COMPSAC
2005
IEEE
14 years 1 months ago
Goal-Oriented Test Data Generation for Programs with Pointer Variables
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs goalorient...
Arnaud Gotlieb, Tristan Denmat, Bernard Botella
ICDAR
2009
IEEE
14 years 2 months ago
Generic Feature Selection and Document Processing
This paper presents a generic features selection method and its applications on some document analysis problems. The method is based on a genetic algorithm (GA), whose tness funct...
Hassan Chouaib, Nicole Vincent, Florence Cloppet, ...
SIAMSC
2008
140views more  SIAMSC 2008»
13 years 7 months ago
Compact Fourier Analysis for Designing Multigrid Methods
The convergence of Multigrid methods can be analyzed based on a Fourier analysis of the method or by proving certain inequalities that have to be fulfilled by the smoother and by t...
Thomas K. Huckle
PLDI
2003
ACM
14 years 26 days ago
Predicting whole-program locality through reuse distance analysis
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here loc...
Chen Ding, Yutao Zhong
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
14 years 1 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi