24 search results - page 4 / 5 » A note on the MIR closure |
PRIS
2004
13 years 8 months ago
2004
Abstract. The main area of work in computer music related to information systems is known as music information retrieval (MIR). Databases containing musical information can be clas...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
JCT
2000
13 years 7 months ago
2000
A partial order on Z obtained by taking the transitive closure of a random relation {i < j and there is an edge ij} is studied. Randomness stems from postulating that an edge ij...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
CSL
2010
Springer
13 years 7 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...