Binary-clause reasoning has been shown to reduce the size of the search space on many satisfiability problems, but has often been so expensive that run-time was higher than that o...
Abstract-- We present a novel GPU-based algorithm for highquality rendering of bivariate spline surfaces. An essential difference to the known methods for rendering graph surfaces ...
Gerd Reis, Frank Zeilfelder, Martin Hering-Bertram...
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
Ernie Chan, Robert A. van de Geijn, Andrew Chapman
—Phylogenetic networks are leaf-labeled, rooted, acyclic, directed graphs, that are used to model reticulate evolutionary histories. Several measures for quantifying the topologi...