Conference paper
Song classifications for dancing
Prague Stringology Conference 2006 (Czech Technical University, Prague, 28/08/2006–30/08/2006)
2006
Abstract
A fundamental problem in music is to classify songs according to their rhythm. A rhythm is represented by a sequence of Quick (Q) and Slow (S) symbols, which correspond to the (relative) duration of notes, such that S=QQ. In this paper we present a linear algorithm for locating the maximum-length substring of a music text t that can be covered by a given rhythm r. An efficient algorithm to solve this problem, can then be used to find which rhythm, from a given set of such rhythms, covers the largest part of the music sequence under question, and thus best describes that sequence.
Details
- Title
- Song classifications for dancing
- Authors/Creators
- M. Christodoulakis (Author/Creator)C.S. Ilopoulos (Author/Creator)M.S. Rahman (Author/Creator)W.F. Smyth (Author/Creator)
- Conference
- Prague Stringology Conference 2006 (Czech Technical University, Prague, 28/08/2006–30/08/2006)
- Identifiers
- 991005545996907891
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Conference paper
Metrics
83 File views/ downloads
58 Record Views