2638 search results - page 154 / 528 » Random Geometric Complexes |
164
click to vote
ACL
2009
15 years 4 months ago
2009
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...
230
click to vote
STACS
2012
Springer
14 years 2 months ago
2012
Springer
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...
188
Voted
ECCV
1996
Springer
16 years 8 months ago
1996
Springer
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 ...
171
click to vote
ACMSE
2006
ACM
16 years 13 days ago
2006
ACM
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...
157
click to vote
EOR
2006
15 years 6 months ago
2006
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...