Efficient one-pass estimation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consider range-efficient estimation of F0: estimation of the number of distinct elements in a data stream where each element of the stream is not just a single integer, but an interval of integers. We present a randomized alg...

Many sequential prediction tasks involve locating instances of patterns in sequences. Generative probabilistic language models, such as hidden Markov models (HMMs), have been successfully applied to many of these tasks. A limitation of these models however, is that they cannot naturally handle cases in which pattern instances overlap in arbitrary ways. We present an alternative approach, based ...

In this paper we investigate the top-k-selection problem, i.e. determine the largest, second largest, ..., and the k-th largest elements, in the dynamic data model. In this model the order of elements evolves dynamically over time. In each time step the algorithm can only probe the changes of data by comparing a pair of elements. Previously only two special cases were studied [2]: finding the l...

With this work, we demonstrate SALUS Patient History Tool which presents patient summaries to the clinical researcher by retrieving the values of the patient data fields from the semantic instances which come in the form of SALUS Common Information Model. The tool makes use of the SALUS Common Data Elements to extract the corresponding data from the semantic instance before presenting to the re...

Incorporation of fuzziness into database systems allows to expand the analysis of data during the querying process. Approximate processing of data includes not only rows that exactly meet the search criteria, but also rows that are similar with the given range of tolerance. Queries formulated in natural language usually consist of imprecise and fuzzy terms. However, the implementation of the im...

....................................................................................................................................... iii ACKNOWLEDGEMENTS .................................................................................................................... v TABLE OF CONTENTS...........................................................................................................

The problem addressed here is yet another artificial intelligence problem that is easily solved by young children yet challenges even sophisticated computer programs. This thesis’s canonical example is a scene featuring two entities drinking. In one scene, a cat drinks from a faucet. In the other, a human drinks from a glass. Even young humans can identify that the two images are similar in tha...

The evaluation of the nuclear matrix elements (NME) of the twoneutrino double beta (2νββ) decay and neutrinoless double beta (0νββ) decay using the proton-neutron quasiparticle random-phase approximation (pnQRPA) is addressed. In particular, the extraction of a proper value of the proton-neutron particle-particle interaction parameter, gpp, of this theory is analyzed in detail. Evidence is show...

Many large-scale machine learning problems (such as clustering, non-parametric learning, kernel machines, etc.) require selecting, out of a massive data set, a manageable yet representative subset. Such problems can often be reduced to maximizing a submodular set function subject to cardinality constraints. Classical approaches require centralized access to the full data set; but for truly larg...

Many sequential prediction tasks involve locating instances of patterns in sequences. Generative probabilistic language models, such as hidden Markov models (HMMs), have been successfully applied to many of these tasks. A limitation of these models however, is that they cannot naturally handle cases in which pattern instances overlap in arbitrary ways. We present an alternative approach, based ...