4865 search results - page 490 / 973 » The Complexity of Graph Connectivity |
201
click to vote
ICDAR
2011
IEEE
14 years 6 months ago
2011
IEEE
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...
218
click to vote
PAM
2012
Springer
14 years 2 months ago
2012
Springer
This paper studies the AS-level re-wiring dynamics (changes in the connectivity) of malicious networks. Anecdotal evidence suggests that some malicious ASes that are primarily invo...
185
click to vote
PODC
2005
ACM
16 years 16 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
266
click to vote
MST
2010
15 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
222
click to vote
GRC
2005
IEEE
16 years 18 days ago
2005
IEEE
Abstract. A new methodology that structures the semantics of a collection of documents into the geometry of a simplicial complex is developed. A simplicial complex is topologically...