598 search results - page 58 / 120 » A random graph model for massive graphs |
COLING
2010
14 years 6 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
IBPRIA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper extends and generalizes the Bayesian semisupervised segmentation algorithm [1] for oil spill detection using SAR images. In the base algorithm on which we buil...
106
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
101
click to vote
SIAMDM
2008
14 years 11 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
127
click to vote
SAC
2002
ACM
14 years 11 months ago
2002
ACM
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...