We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
: Due to the deregulation of the telecom network and the Internet, users will have access to an increasing number of heterogeneous communication services and will need to adapt the...
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...
Next generation communication systems must support diverse applications operating over high-performance local, metropolitan, and wide area networks. This paper describes a framewo...
Douglas C. Schmidt, Burkhard Stiller, Tatsuya Suda...
During the previous years, we presented several results concerned with various issues related to the correctness of models for business processes and services (i. e., interorganiza...