2004 search results - page 89 / 401 » Sampling from large graphs |
WAW
2004
Springer
15 years 5 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
112
click to vote
JCP
2008
14 years 12 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
119
click to vote
SAC
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we describe a new approach for mining concept associations from large text collections. The concepts are short sequences of words that occur frequently together acr...
TCAD
2002
14 years 11 months ago
2002
Embedded hard real-time software systems often need fine-grained parallelism and precise control of timing, things typical real-time operating systems do not provide. The Esterel l...
101
click to vote
SP
2010
IEEE
15 years 3 months ago
2010
IEEE
—Captchas are designed to be easy for humans but hard for machines. However, most recent research has focused only on making them hard for machines. In this paper, we present wha...