2004 search results - page 25 / 401 » Sampling from large graphs |
112
click to vote
ICPR
2010
IEEE
15 years 28 days ago
2010
IEEE
—Most research works focus on pattern recognition within a small sample images but strategies for running efficiently these algorithms over large images are rarely if ever speci...
143
click to vote
NIPS
2003
15 years 3 months ago
2003
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...
96
Voted
JCT
2007
15 years 1 months ago
2007
Abstract. We prove that a binary matroid with huge branchwidth contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids ca...
113
click to vote
WWW
2010
ACM
15 years 9 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
111
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...