49 search results - page 4 / 10 » Approximation and Complexity of k-Splittable Flows |
ICFP
2007
ACM
14 years 10 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
JCPHY
2011
13 years 1 months ago
2011
We present a Riemann solver derived by a relaxation technique for classical single-phase shallow flow equations and for a two-phase shallow flow model describing a mixture of so...
ECCV
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...
BMCBI
2007
13 years 11 months ago
2007
Background: Although testing for simultaneous divergence (vicariance) across different population-pairs that span the same barrier to gene flow is of central importance to evoluti...
SIGMOD
2011
ACM
13 years 1 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...