default search action
David Meredith 0001
Person information
- affiliation: Aalborg University, Denmark
Other persons with the same name
- David Meredith 0002 — Merrimack, New Hampshire, USA
- David Meredith 0003 — CCLRC Daresbury Laboratory, UK
- David Meredith 0004 — Kemp Little LLP, London, UK
- David Meredith 0005 — Coal Services Health Coal Services, Singleton, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Emmanuel Deruty, David Meredith, Stefan Lattner:
The evolution of inharmonicity and noisiness in contemporary popular music. CoRR abs/2408.08127 (2024) - 2023
- [c18]David Meredith
:
Understanding and Compressing Music with Maximal Transformable Patterns. HCI (25) 2023: 309-325 - 2022
- [i3]David Meredith
Understanding and Compressing Music with Maximal Transformable Patterns. CoRR abs/2201.11085 (2022)
2010 – 2019
- 2019
- [c17]Viktor Schmuck, David Meredith:
training networks separately on static and dynamic obstacles improves collision avoidance during indoor robot navigation. ESANN 2019 - [c16]Brian Bemman, David Meredith:
Backtracking Search Heuristics for Solving the All-partition Array Problem. ISMIR 2019: 391-397 - [c15]David Meredith
RecurSIA-RRT: Recursive Translatable Point-Set Pattern Discovery with Removal of Redundant Translators. PKDD/ECML Workshops (2) 2019: 485-493 - [c14]Viktor Schmuck, David Meredith
OPTISIA: An Evolutionary Approach to Parameter Optimisation in a Family of Point-Set Pattern-Discovery Algorithms. PKDD/ECML Workshops (2) 2019: 509-516 - [i2]David Meredith:
RECURSIA-RRT: Recursive translatable point-set pattern discovery with removal of redundant translators. CoRR abs/1906.12286 (2019) - 2018
- [j3]Brian Bemman, David Meredith
Generating New Musical Works in the Style of Milton Babbitt. Comput. Music. J. 42(1) (2018) - 2016
- [c13]Tsubasa Tanaka, Brian Bemman, David Meredith
Constraint Programming Approach to the Problem of Generating Milton Babbitt's All-Partition Arrays. CP 2016: 802-810 - [c12]Gissel Velarde, Tillman Weyde, Carlos Eduardo Cancino Chacón, David Meredith, Maarten Grachten:
Composer Recognition Based on 2D-Filtered Piano-Rolls. ISMIR 2016: 115-121 - [c11]Tsubasa Tanaka, Brian Bemman, David Meredith:
Integer Programming Formulation of the Problem of Generating Milton Babbitt's All-Partition Arrays. ISMIR 2016: 171-177 - [p2]Gissel Velarde, David Meredith
A Wavelet-Based Approach to Pattern Discovery in Melodies. Computational Music Analysis 2016: 303-333 - [p1]David Meredith
Analysing Music with Point-Set Compression Algorithms. Computational Music Analysis 2016: 335-366 - [e2]David Meredith
Computational Music Analysis. Springer 2016, ISBN 978-3-319-25929-1 [contents] - 2015
- [c10]Brian Bemman, David Meredith
Exact Cover Problem in Milton Babbitt's All-Partition Array. MCM 2015: 237-242 - [e1]Tom Collins, David Meredith
Mathematics and Computation in Music - 5th International Conference, MCM 2015, London, UK, June 22-25, 2015, Proceedings. Lecture Notes in Computer Science 9110, Springer 2015, ISBN 978-3-319-20602-8 [contents] - 2014
- [c9]David Meredith
Compression-based geometric pattern discovery in music. CIP 2014: 1-6 - [c8]Caspar Mølholt Kjellberg, David Meredith:
CriticalEd: A Tool for Assisting with the Creation of Critical Commentaries. ICMC 2014 - 2013
- [c7]Tom Collins, David Meredith
Maximal Translational Equivalence Classes of Musical Patterns in Point-Set Representations. MCM 2013: 88-99 - 2012
- [c6]David Meredith:
A Geometric Language for Representing Structure in Polyphonic Music. ISMIR 2012: 133-138 - 2011
- [c5]David Meredith
Tonal Scales and Minimal Simple Pitch Class Cycles. MCM 2011: 165-179
2000 – 2009
- 2007
- [j2]David Meredith
Optimizing Chew and Chen's Pitch-Spelling Algorithm. Comput. Music. J. 31(2): 54-72 (2007) - 2006
- [c4]Raphaël Clifford, Manolis Christodoulakis, Tim Crawford, David Meredith, Geraint A. Wiggins:
A Fast, Randomised, Maximal Subset Matching Algorithm for Document-Level Music Retrieval. ISMIR 2006: 150-155 - [i1]David Meredith:
Point-set algorithms for pattern discovery and pattern matching in music. Content-Based Retrieval 2006 - 2005
- [c3]David Meredith, Geraint A. Wiggins:
Comparing Pitch Spelling Algorithms. ISMIR 2005: 280-287 - 2004
- [j1]Marcus T. Pearce, David Meredith:
The Second International Symposium on Computer Music Modeling and Retrieval (CMMR 2004) Aalborg University Esbjerg, Esbjerg, Denmark, 26-29 May 2004. Comput. Music. J. 28(4): 91-93 (2004) - [c2]David Meredith:
Comparing Pitch Spelling Algorithms on a Large Corpus of Tonal Music. CMMR 2004: 173-192 - 2002
- [c1]Geraint A. Wiggins, Kjell Lemström, David Meredith:
SIA(M)ESE: An Algorithm for Transposition Invariant, Polyphonic Content-Based Music Retrieval. ISMIR 2002
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: