We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
This paper investigates the pre-conditions for successful combination of document representations formed from structural markup for the task of known-item search. As this task is ...
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
We present UDP datagram demultiplexing techniques that can yield potentially substantial applicationindependent performance gains over BSD-derived UDP implementations. Our demulti...
Stochastic local search (SLS) methods are underlying some of the best-performing algorithms for certain types of SAT instances, both from an empirical as well as from a theoretical...