2004 search results - page 132 / 401 » Sampling from large graphs |
121
click to vote
GC
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
116
click to vote
JGT
2007
15 years 3 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
136
click to vote
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
154
click to vote
AC
2000
Springer
15 years 7 months ago
2000
Springer
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
144
click to vote
IMC
2009
ACM
15 years 9 months ago
2009
ACM
Online Social Networks (OSNs) have already attracted more than half a billion users. However, our understanding of which OSN features attract and keep the attention of these users...