250
click to vote
ESA
2011
Springer
14 years 6 months 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...
324
click to vote
ESA
2011
Springer
14 years 6 months 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...
263
click to vote
ESA
2011
Springer
14 years 6 months 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...
238
click to vote
ESA
2011
Springer
14 years 6 months 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...