Sciweavers

319 search results - page 37 / 64
» Precise Dynamic Slicing Algorithms
Sort
View
IJFCS
2006
91views more  IJFCS 2006»
13 years 7 months ago
Bit-parallel Computation of Local Similarity Score Matrices with Unitary Weights
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
Heikki Hyyrö, Gonzalo Navarro
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
14 years 24 days ago
Source-Based Trace Exploration
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
Olaf Chitil
ICIP
2009
IEEE
14 years 8 months ago
Polar Snakes: A Fast And Robust Parametric Active Contour Model
We present in this paper a way to perform a fast and robust image segmentation and to track a contour along a sequence of images. Our approach is based on a dynamic deformable mod...
ECOOP
2000
Springer
13 years 11 months ago
Optimizing Java Programs in the Presence of Exceptions
The support for precise exceptions in Java, combined with frequent checks for runtime exceptions, leads to severe limitations on the compiler’s ability to perform program optimiz...
Manish Gupta, Jong-Deok Choi, Michael Hind
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
14 years 2 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard