Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
Current trust models enable decision support at an implicit level by means of thresholds or constraint satisfiability. Decision support is mostly included only for a single binary...
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
We propose a geometric approach to 3D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the po...
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...