This article introduces a new method of a decision tree construction. Such decision tree is constructed with the usage of additional cuts that are used for a veri cation of cuts in tree nodes during the classi cation of objects. The presented approach allows the use of additional knowledge contained in the attributes which could be eliminated using greedy methods. The paper includes the results...

We consider the case where a pool of DNA molecules clones both, ipped and not-ipped, have been cut by restriction enzymes. Ideally, each clone is cut in the same positions, although in practice due to errors, this does not always happen. The computational problem is to determine where the cuts have occurred. This is a key problem in determining the structure of the original DNA molecule. A sing...

In this paper, we study the relationship between 2D lattice-free cuts, the family of cuts obtained by taking two-row relaxations of a mixed-integer program (MIP) and applying intersection cuts based on maximal lattice-free sets in R, and various types of disjunctions. Recently, Li and Richard (2007) studied disjunctive cuts obtained from t-branch split disjunctions of mixed-integer sets (these ...

We consider the genus-one curves which arise in cuts of sunrise and elliptic double-box Feynman integrals. compute compare invariants these a number ways, including parametrization, lightcone Baikov (in full loop-by-loop variants). find that same geometry for arises all cases, lends support to idea there exists an invariant notion geometry, independent on way it is computed. further indicate ho...

We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions with homogeneous colors in many images and propose to use image characteristics to recognize them. We use patterns in the data dependent triangulations of images to learn characteristics of the scene. As our learning met...

We propose a new class of Foundation-Penalty (FP) cuts for GUB-constrained (and ordinary) mixed-integer programs, which are easy to generate by exploiting standard penalty calculations that are routinely employed in branch-and-bound contexts. The FP cuts are derived with reference to a selected integer variable or GUB set, and a foundation function that is typically a reduced cost function corr...