Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
■ We employ a single-trial correlational MEG analysis technique to investigate early processing in the visual recognition of morphologically complex words. Three classes of affi...
We present a novel technique for automated problem decomposition to address the problem of scalability in reinforcement learning. Our technique makes use of a set of near-optimal ...
Peng Zang, Peng Zhou, David Minnen, Charles Lee Is...
—In this paper, the DMOEA-DD, which is an improvement of DMOEA[1, 2] by using domain decomposition technique, is applied to tackle the CEC 2009 MOEA competition test instances th...
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Ja...