In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
It is becoming increasingly clear that we are entering a new era in systems software. As the age-old tension between structure and performance acquiesces, we can finally venture b...
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
In this paper, we introduce a new approach for partial 3D face recognition, which makes use of shape decomposition over the rigid1 part of a face. To explore the descriptiveness o...
In this paper, we revisit the noise-reduction problem in the time domain and present a way to decompose the ltered speech into two uncorrelated (orthogonal) components: the desire...
Jingdong Chen, Jacob Benesty, Yiteng Huang, Tomas ...