Sciweavers

Share
ESA
2011
Springer
252views Algorithms» more  ESA 2011»
7 years 8 months ago
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
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...
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
7 years 8 months ago
Improved Algorithms for Partial Curve Matching
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...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...
ESA
2011
Springer
269views Algorithms» more  ESA 2011»
7 years 8 months ago
Alphabet-Independent Compressed Text Indexing
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...
Djamal Belazzougui, Gonzalo Navarro
ESA
2011
Springer
235views Algorithms» more  ESA 2011»
7 years 8 months ago
AdCell: Ad Allocation in Cellular Networks
Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liag...
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
7 years 8 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
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...
Josep Díaz, Alberto Marchetti-Spaccamela, D...
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
7 years 8 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
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...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
7 years 8 months ago
On Variants of the Matroid Secretary Problem
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...
Shayan Oveis Gharan, Jan Vondrák
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
7 years 8 months ago
Distribution-Aware Compressed Full-Text Indexes
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 ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
ESA
2011
Springer
210views Algorithms» more  ESA 2011»
7 years 8 months ago
Submodular Max-SAT
Yossi Azar, Iftah Gamzu, Ran Roth
ESA
2011
Springer
213views Algorithms» more  ESA 2011»
7 years 8 months ago
Mixed-Criticality Scheduling of Sporadic Task Systems
Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D...
books