ESA
2011
Springer
13 years 9 days ago
2011
Springer
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
ESA
2011
Springer
13 years 9 days ago
2011
Springer
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
ESA
2011
Springer
13 years 9 days ago
2011
Springer
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
ESA
2011
Springer
13 years 9 days ago
2011
Springer
ESA
2011
Springer
13 years 9 days ago
2011
Springer
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
ESA
2011
Springer
13 years 9 days ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
ESA
2011
Springer
13 years 9 days ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
ESA
2011
Springer
13 years 9 days ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
ESA
2011
Springer
13 years 9 days ago
2011
Springer
ESA
2011
Springer
13 years 9 days ago
2011
Springer