Sciweavers

730 search results - page 14 / 146
» Combinatorics of Monotone Computations
Sort
View
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 8 months ago
A Few More Cyclic Steiner 2-Designs
In this paper, we prove the existence of a cyclic (v, 4, 1)-BIBD for v = 12t + 4, 3 t 50 using computer programs, which are useful in recursive constructions for cyclic designs....
Kejun Chen, Ruizhong Wei
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 8 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison
COMBINATORICS
2007
65views more  COMBINATORICS 2007»
13 years 8 months ago
On Certain Integral Schreier Graphs of the Symmetric Group
We compute the spectrum of the Schreier graph of the symmetric group Sn corresponding to the Young subgroup S2 × Sn−2 and the generating set consisting of initial reversals. In ...
Paul E. Gunnells, Richard A. Scott, Byron L. Walde...
TPDS
1998
92views more  TPDS 1998»
13 years 8 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
AAAI
2010
13 years 10 months ago
Exploiting Monotonicity in Interval Constraint Propagation
We propose in this paper a new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), that exploits monotonicity of functions. The propagation is sta...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu