2079 search results - page 219 / 416 » Universality of random graphs |
177
click to vote
TON
2010
15 years 5 months ago
2010
Abstract—In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tr...
144
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
164
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
184
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
170
click to vote
DAM
2010
15 years 6 months ago
2010
Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates...