We present a method for searching databases of symbolically represented polyphonic music that exploits advantages of transportation distances such as continuity and partial matchi...
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Time series representations are common in MIR applications such as query-by-humming, where a sung query might be represented by a series of ‘notes’ for database retrieval. Whi...
Norman H. Adams, Mark A. Bartsch, Jonah Shifrin, G...
Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for Internet-scale information retrieval and search systems because they require neither...
Video information retrieval requires a system to find information relevant to a query which may be represented simultaneously in different ways through a text description, audio...