865 search results - page 130 / 173 » Random graph models for the web graph |
133
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
107
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
138
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
130
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
144
click to vote
PET
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...