The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Java program debugging was investigated in computer science students who used a software debugging environment (SDE) that provided concurrently displayed, adjacent, multiple and l...
Pablo Romero, Rudi Lutz, Richard Cox, Benedict du ...
This paper presents a loosely coupled service-composition paradigm. This paradigm employs a distributed data flow that differs markedly from centralized information flow adopted b...
David Liu, Jun Peng, Kincho H. Law, Gio Wiederhold
The potential for physical flora collections to support scientific research is being enhanced by rapid development of digital databases that represent characteristics of the physic...
Tom Auer, Alan M. MacEachren, Craig McCabe, Scott ...
Bateau Ivre is a project presented on the Seine River to make a large audience aware of the possible developments of Augmented Reality through an artistic installation in a mobile...
Christian Jacquemin, Wai Kit Chan, Matthieu Courge...