The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthi...
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
Christian Drescher, Martin Gebser, Benjamin Kaufma...
ion for Epistemic Model Checking of Dining Cryptographers-based Protocols Omar I. Al-Bataineh and Ron van der Meyden School of Computer Science and Engineering, University of New S...
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...