2004 search results - page 118 / 401 » Sampling from large graphs |
111
click to vote
GD
1998
Springer
15 years 7 months ago
1998
Springer
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
143
click to vote
ICML
1996
IEEE
16 years 3 months ago
1996
IEEE
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
141
click to vote
RSA
2011
14 years 10 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
127
click to vote
KDD
2003
ACM
16 years 3 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
132
click to vote
PVLDB
2008
15 years 2 months ago
2008
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...