366 search results - page 12 / 74 » Dynamic Programming for Graphs on Surfaces |
DAGSTUHL
2001
13 years 8 months ago
2001
To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture an...
CVPR
2010
IEEE
14 years 2 months ago
2010
IEEE
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
SEKE
2001
Springer
13 years 11 months ago
2001
Springer
Source code analysis and inspection does not provide enough information to describe the structure of an objectoriented program completely because there are components and relation...
ESOP
2006
Springer
13 years 10 months ago
2006
Springer
This paper describes FrTime, an extension of Scheme designed for writing interactive applications. Inspired by functional reactive programming, the language embeds dynamic dataflow...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...