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)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Yuta Sakai, Ken-ichi Iwata
- 2017 IEEE International Symposium on Informationâ€¦
- 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

- Ken-ichi Iwata, Shin-ya Ozawa
- 2014 IEEE International Symposium on Informationâ€¦
- 2014

The quantizer design algorithm was recently proposed by Kurkoski and Yagi for arbitrary binary-input discrete memoryless channelsâ€¦Â (More)

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)

Is this relevant?

2006

2006

- Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang
- Theory of Computing Systems
- 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)

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)

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)

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)

Is this relevant?