Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method co...
Given the resurgent attractiveness of single-instruction-multiple-data (SIMD) processing, it is important for high-performance computing applications to be SIMD-capable. The Hartr...
Tirath Ramdas, Gregory K. Egan, David Abramson, Ki...
In the rapidly evolving field of genomics, many clustering and classification methods have been developed and employed to explore patterns in gene expression data. Biologists face...
Xueli Liu, Sheng-Chien Lee, George Casella, Gary F...
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
Jacques Carlier, Mohamed Haouari, Mohamed Kharbech...