Learning to cope with domain change has been known
as a challenging problem in many real-world applications.
This paper proposes a novel and efficient approach, named
domain ada...
Yu-Gang Jiang, Jun Wang, Shih-Fu Chang, Chong-Wah ...
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...