Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
In this paper, we present a “value mapping” algorithm that does not rely on syntactic similarity or semantic interpretation of the values. The algorithm first constructs a st...
Jaewoo Kang, Tae Sik Han, Dongwon Lee, Prasenjit M...
Composition, listening, and performance are essential activities in classroom music education, yet conventional music classes impose unnecessary limitations on students’ ability...
Yinsheng Zhou, Graham Percival, Xinxi Wang, Ye Wan...
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...