Sciweavers

1986 search results - page 332 / 398
» Path Separability of Graphs
Sort
View
ICPR
2000
IEEE
13 years 11 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
APN
1995
Springer
13 years 11 months ago
Modular State Space Analysis of Coloured Petri Nets
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem of state space analysis is the size of the state spaces. Several ways to reduce ...
Søren Christensen, Laure Petrucci
ECOOP
1995
Springer
13 years 11 months ago
Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis
Optimizing compilers for object-oriented languages apply static class analysis and other techniques to try to deduce precise information about the possible classes of the receivers...
Jeffrey Dean, David Grove, Craig Chambers
BTW
2009
Springer
99views Database» more  BTW 2009»
13 years 11 months ago
A Framework for Reasoning about Share Equivalence and Its Integration into a Plan Generator
: Very recently, Cao et al. presented the MAPLE approach, which accelerates queries with multiple instances of the same relation by sharing their scan operator. The principal idea ...
Thomas Neumann, Guido Moerkotte
ATMOS
2007
119views Optimization» more  ATMOS 2007»
13 years 9 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte