Sciweavers

10602 search results - page 293 / 2121
» Weakly Useful Sequences
Sort
View
CPAIOR
2005
Springer
16 years 9 days ago
Combination of Among and Cardinality Constraints
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...
Jean-Charles Régin
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
15 years 8 months ago
Dynamic optimality for skip lists and B-trees
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 [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...
ICONIP
2004
15 years 8 months ago
A Neural Network Model for Trace Conditioning
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...
Tadashi Yamazaki, Shigeru Tanaka
ICIP
2004
IEEE
16 years 8 months ago
Motion estimation in high resolution image reconstruction from compressed video sequences
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...
163
Voted
APLAS
2009
ACM
16 years 1 months ago
A Short Cut to Optimal Sequences
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 ...
Akimasa Morihata