The Earth Mover's distance was first introduced as a purely empirical way to measure texture and color similarities. We show that it has a rigorous probabilistic interpretati...
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Abstract. A new, exemplar-based, probabilistic paradigm for visual tracking is presented. Probabilistic mechanisms are attractive because they handle fusion of information, especia...
Adapting to rank address the the problem of insufficient domainspecific labeled training data in learning to rank. However, the initial study shows that adaptation is not always...
Keke Chen, Jing Bai, Srihari Reddy, Belle L. Tseng
In this paper we propose algorithms for combining and ranking answers from distributed heterogeneous data sources in the context of a multi-ontology Question Answering task. Our pr...