Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
Distributed systems are inherently complex, and therefore difficult to design and develop. Experience shows that new technologies—such as components, aspects, and application f...
Performing distributed consensus in a network has been an important research problem for several years, and is directly applicable to sensor networks, autonomous vehicle formation...
Daniel Thai, Elizabeth Bodine-Baron, Babak Hassibi
In this paper we present the design of a modern course in cluster computing and large-scale data processing. The defining differences between this and previously published designs...
Aaron Kimball, Sierra Michels-Slettvet, Christophe...