Data compression algorithms change frequently, and obsolete decoders do not always run on new hardware and operating systems, threatening the long-term usability of content archiv...
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
The winged- and half- edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory to computer graphics course ...
One of the key functions to popularize 3D content services on virtual environments is on the extensibility of the underlying system. In our previous work, we had implemented an ext...
Spelling speech recognition can be applied for several purposes including enhancement of speech recognition systems and implementation of name retrieval systems. This paper presen...