Sciweavers

1736 search results - page 263 / 348
» On antimagic directed graphs
Sort
View
AMAI
2005
Springer
14 years 11 months ago
Toward leaner binary-clause reasoning in a satisfiability solver
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...
Allen Van Gelder
TVCG
2008
92views more  TVCG 2008»
14 years 11 months ago
High-Quality Rendering of Quartic Spline Surfaces on the GPU
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...
JGO
2010
115views more  JGO 2010»
14 years 10 months ago
Maximum flows and minimum cuts in the plane
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 ...
Gilbert Strang
SPAA
2010
ACM
14 years 10 months ago
Managing the complexity of lookahead for LU factorization with pivoting
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
TCBB
2010
107views more  TCBB 2010»
14 years 10 months ago
A Metric on the Space of Reduced Phylogenetic Networks
—Phylogenetic networks are leaf-labeled, rooted, acyclic, directed graphs, that are used to model reticulate evolutionary histories. Several measures for quantifying the topologi...
Luay Nakhleh