Sciweavers

48 search results - page 2 / 10
» The Minimum Number of Monotone Subsequences
Sort
View
COMBINATORICS
1998
80views more  COMBINATORICS 1998»
13 years 7 months ago
Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks
Let α and β be a partition of {1, . . . , n} into two blocks. A merging network is a network of comparators which allows as input arbitrary real numbers and has the property tha...
Edward A. Bender, S. Gill Williamson
COCOON
2009
Springer
14 years 2 months ago
On the Readability of Monotone Boolean Formulae
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
TPDS
1998
92views more  TPDS 1998»
13 years 7 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
SAC
2006
ACM
14 years 1 months ago
Looking for monotonicity properties of a similarity constraint on sequences
Constraint-based mining techniques on sequence databases have been studied extensively the last few years and efficient algorithms enable to compute complete collections of patte...
Ieva Mitasiunaite, Jean-François Boulicaut
IANDC
1998
64views more  IANDC 1998»
13 years 7 months ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...