4302 search results - page 332 / 861 » Index Pairs Algorithms |
173
Voted
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
122
click to vote
IPL
2008
15 years 4 months ago
2008
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...
166
click to vote
JSC
2007
15 years 4 months ago
2007
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...
131
Voted
IJCV
2000
15 years 4 months ago
2000
Abstract. We describe a novel automatic technique for finding a dense correspondence between a pair of n-dimensional surfaces with arbitrary topologies. This method employs a diffe...
122
click to vote
PR
2007
15 years 4 months ago
2007
We present a new contrast enhancing color to grayscale conversion algorithm which works in real-time. It incorporates novel techniques for image sampling and dimensionality reduct...