This presentation will focus primarily on work being done at Indiana University in the area of digital music libraries, with some discussion of related efforts. Indiana University...
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
A given business process may face a large number of regulatory obligations the process may or comply with. Providing tools and techniques through which an evaluation of the complia...
d at a high abstraction level, and consists in an expectation-driven search starting from symbolic object descriptions and using a version of a distributed blackboard system for re...
Gian Luca Foresti, Vittorio Murino, Carlo S. Regaz...
Background: The most common substitution matrices currently used (BLOSUM and PAM) are based on protein sequences with average amino acid distributions, thus they do not represent ...