87 search results - page 3 / 18 » Limits of dense graph sequences |
CN
2010
13 years 6 months ago
2010
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
RSA
2010
13 years 4 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
TCS
2010
13 years 28 days ago
2010
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
IPPS
2010
IEEE
13 years 4 months ago
2010
IEEE
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
ICIP
2000
IEEE
14 years 7 months ago
2000
IEEE
The limitations of estimating structure from either stereo or motion alone can be addressed by the use of stereo image sequences; however, many existing techniques for processing ...