Sciweavers

521 search results - page 49 / 105
» On Stable Matchings and Flows
Sort
View
ESOP
2010
Springer
15 years 3 months ago
CFA2: A Context-Free Approach to Control-Flow Analysis
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
Dimitrios Vardoulakis, Olin Shivers
IPCO
1998
87views Optimization» more  IPCO 1998»
15 years 1 months ago
Simple Generalized Maximum Flow Algorithms
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
Éva Tardos, Kevin D. Wayne
MVA
1996
129views Computer Vision» more  MVA 1996»
15 years 1 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 12 months ago
Pushdown Control-Flow Analysis of Higher-Order Programs
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...
Christopher Earl, Matthew Might, David Van Horn
CVPR
2011
IEEE
14 years 7 months ago
Discriminative Image Warping with Attribute Flow
We address the problem of finding deformation between two images for the purpose of recognizing objects. The challenge is that discriminative features are often transformation-va...
Weiyu Zhang, Praveen Srinivasan, Jianbo Shi