Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
In this paper we discuss the construction of an automated information system for a collection of visual reproductions of art objects. Special attention is payed to the economical a...
F. J. M. Bosman, Peter Bruza, Theo P. van der Weid...
Reactivity, the ability to detect events and respond to them automatically through reactive programs, is a key requirement in many present-day information systems. Work on Web Serv...
We propose a novel probabilistic method based on the Hidden Markov Model (HMM) to learn the structure of a Latent Variable Model (LVM) for query language modeling. In the proposed...