The rapid growth of wireless networks and services, integrated with the next-generation mobile communication systems, has led to designing efficient handoff protocols to handle m...
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
In this paper, a robust and efficient digital image watermarking algorithm using the fast Hadamard transform (FHT) is proposed for the copyright protection of digital images. This...
Anthony Tung Shuen Ho, Jun Shen, A. K. K. Chow, J....
Even though its advantages such as non-volatility, fast write access time and solid-state shock resistance, NAND flash memory suffers from out-place-update, limited erase cycles, a...
Song-Hwa Park, Tae-Hoon Kim, Tae-Hoon Lee, Ki-Dong...
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...