• Corpus ID: 22375759

Corpus-compressed Streaming and the Spotify Problem

@article{Alston2017CorpuscompressedSA,
  title={Corpus-compressed Streaming and the Spotify Problem},
  author={Aubrey Alston},
  journal={ArXiv},
  year={2017},
  volume={abs/1707.00080}
}
  • A. Alston
  • Published 1 July 2017
  • Computer Science
  • ArXiv
In this work, we describe a problem which we refer to as the \textbf{Spotify problem} and explore a potential solution in the form of what we call corpus-compressed streaming schemes. Inspired by the problem of constrained bandwidth during use of the popular Spotify application on mobile networks, the Spotify problem applies in any number of practical domains where devices may be periodically expected to experience degraded communication or storage capacity. One obvious solution candidate… 

Figures from this paper

References

SHOWING 1-6 OF 6 REFERENCES

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences

Finding shortest common supersequences (SCS) and longest common subsequences (LCS) for a given set of sequences are two well-known NP-hard problems. They have important applications in many areas

Fast balanced partitioning is hard even on grids and trees

The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete

Graph-Based Algorithms for Boolean Function Manipulation

An Introduction to Kolmogorov Complexity

An Introduction to Kolmogorov Complexity and Its Applications