Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
The central topic of the paper is the learnability of the recursively enumerable subspaces of V∞/V , where V∞ is the standard recursive vector space over the rationals with (c...
In this paper we predict the relevance of images based on a lowdimensional feature space found using several users’ eye movements. Each user is given an image-based search task,...
Zakria Hussain, Kitsuchart Pasupa, John Shawe-Tayl...
Musical harmony is considered to be one of the most and technically difficult parts of music. It is y taught formally via abstract, domain-specific concepts, principles, rules and...
Simon Holland, Paul Marshall, Jon Bird, Nick Sheep...
In the past, several attempts have been made to deal with the state space explosion problem by equipping a depth-first search (DFS) algorithm with a state cache, or by avoiding co...