SMAWK algorithm

The SMAWK algorithm is an algorithm for finding the minimum value in each row of an implicitly-defined totally monotone matrix. It is named after the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1996-2017
012319962017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
This study examines quantization for outputs of binary-input discrete memoryless channels (B-DMCs) by concatenating its output… (More)
Is this relevant?
2014
2014
The quantizer design algorithm was recently proposed by Kurkoski and Yagi for arbitrary binary-input discrete memoryless channels… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
[1] Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, and Robert E. Wilber. Geometric applications of a matrix… (More)
Is this relevant?
2006
2006
There exist several general techniques in the literature for speeding up naive implementations of dynamic programming. Two of the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Consider the dynamic program h(n)=min 1≤j≤n a(n,j), where a(n,j) is some formula that may (online) or may not (offline) depend on… (More)
  • figure 1
  • figure 2
Is this relevant?
2000
2000
In this paper we discuss the problem of nding optimal pre x-free codes for unequal letter costs, a variation of the classical Hu… (More)
  • figure 9
Is this relevant?
1998
1998
In this paper we discuss a variation of the classical Huffman coding problem: finding optimal prefix-free codes for unequal… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1998
1998
The Monge property emerges, sometimes quite mysteriously, in many optimization problems and usually leads to running time… (More)
Is this relevant?
1998
1998
In this paper we discuss a variation of the classical Huuman coding problem: nding optimal preex-free codes for unequal letter… (More)
Is this relevant?
1996
1996
This paper shows that nding the row minima (maxima) in an nn totally monotone matrix in the worst case requires any algorithm to… (More)
  • figure 3
Is this relevant?