366 search results - page 26 / 74 » Dynamic Programming for Graphs on Surfaces |
142
Voted
ICSE
2001
IEEE-ACM
15 years 6 months ago
2001
IEEE-ACM
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
123
Voted
ICSM
2007
IEEE
15 years 8 months ago
2007
IEEE
In many application areas, including piracy detection, software debugging and maintenance, situations arise in which there is a need for comparing two versions of a program that d...
123
click to vote
PEPM
2004
ACM
15 years 7 months ago
2004
ACM
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
105
click to vote
APVIS
2008
15 years 3 months ago
2008
Volume rendering of multiple intersecting volumetric objects is a difficult visualization task, especially if different rendering styles need to be applied to the components, in o...
130
click to vote
ISCAS
1999
IEEE
15 years 6 months ago
1999
IEEE
In this paper, we present the application of dynamic trellis diagrams (DTDs) to automatic translation of data flow graphs (DFGs) into highly optimized programs for digital signal ...