We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Change detection is one of the most commonly encountered low-level tasks in computer vision and video processing. A plethora of algorithms have been developed to date, yet no wide...
Nil Goyette, Pierre-Marc Jodoin, Fatih Porikli, Ja...
We consider the problem of the binary classification on imbalanced data, in which nearly all the instances are labelled as one class, while far fewer instances are labelled as the...
Kaizhu Huang, Haiqin Yang, Irwin King, Michael R. ...
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...