We explore a novel data representation scheme for multilevel flash memory cells, in which a
set of n cells stores information in the permutation induced by the different charge levels of …

USC 154 (b) by 857 days. Aritome, S. et al.,“Reliability issues of flash memory cells'. Pro This
patent is Subject to a terminal dis-ceedings of the IEEE, 81 (5): 776-788 May 1993. claimer …

Given a text T and a pattern P, the order-preserving pattern matching (OPPM) problem is to
find all substrings in T which have the same relative orders as P. The OPPM has been …

This article surveys the many facets of the Minimum Spanning Tree problem. We follow the
history of the problem since the first polynomial-time solution by Bor˚ uvka to the modern …

The branch-and-bound (B&B) procedure is one of the most widely used techniques to get
optimal solutions for the resource-constrained project scheduling problem (RCPSP) …

We study error-correcting codes for permutations under the infinity norm, motivated by a
novel storage scheme for flash memories called rank modulation. In this scheme, a set of n …

We propose to solve a label ranking problem as a structured output regression task. In this
view, we adopt a least square surrogate loss approach that solves a supervised learning …

This paper presents a new joint radar and communication technique based on the classical
stepped frequency radar waveform. The randomization in the waveform, which is achieved …

The rank-modulation scheme has been recently proposed for efficiently storing data in
nonvolatile memories. In this paper, we explore [n, k, d] systematic error-correcting codes for …

The main result of the paper is the first polynomial-time algorithm for ranking bracelets. The
time-complexity of the algorithm is O (k^ 2 n^ 4), where k is the size of the alphabet and n is …