In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
In Proc. European Conf. Computer Vision, 1996, pp. 357{368, Cambridge, UK The performance of Active Contours in tracking is highly dependent on the availability of an appropriate ...
David Reynard, Andrew Wildenberg, Andrew Blake, Jo...
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
In this paper we develop an open queueing network for optimal design of multi-stage assemblies, in which each service station represents a manufacturing or assembly operation. The...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...