We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
—Many complex dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switc...
Emily B. Fox, Erik B. Sudderth, Michael I. Jordan,...
: Cooperative communications have been demonstrated to be effective in combating the multiple fading effects in wireless networks, and improving the network performance in terms of...
Xuedong Liang, Min Chen, Yang Xiao, Ilangko Balasi...
We extend our earlier work on deep-structured conditional random field (DCRF) and develop deep-structured hidden conditional random field (DHCRF). We investigate the use of this n...
We discuss multiclass-multilabel classification problems in which the set of classes is extremely large. Most existing multiclass-multilabel learning algorithms expect to observe ...