4112 search results - page 39 / 823 » Efficient Algorithms for the Spoonerism Problem |
139
Voted
DCG
2000
15 years 3 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
107
Voted
ENC
2003
IEEE
15 years 9 months ago
2003
IEEE
Several lossless data compression schemes have been proposed over the past years. Since Shannon developed information theory in his seminal paper, however, the problem of data com...
111
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
106
click to vote
NA
2008
15 years 3 months ago
2008
Stewart's Krylov-Schur algorithm offers two advantages over Sorensen's implicitly restarted Arnoldi (IRA) algorithm. The first is ease of deflation of converged Ritz vect...
120
Voted
TPDS
1998
15 years 3 months ago
1998
—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...