A cardinality constraint imposes that each value of a set V must be taken a certain number of times by a set of variables X, whereas an among constraint imposes that a certain numb...
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
We studied the dynamics of a neural network which have both of recurrent excitatory and random inhibitory connections. Neurons started to become active when a relatively weak trans...
In order to obtain a high resolution image from a compressed video sequence it is essential to correctly estimate the motion vectors in the sequence. Most of the approaches report...
Luis D. Alvarez, Rafael Molina, Aggelos K. Katsagg...
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...