598 search results - page 91 / 120 » A random graph model for massive graphs |
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
SODA
2010
ACM
15 years 9 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...
ICPR
2008
IEEE
16 years 1 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...
WWW
2010
ACM
15 years 6 months ago
2010
ACM
We consider the problem of deep web source selection and argue that existing source selection methods are inadequate as they are based on local similarity assessment. Specificall...
102
click to vote
FOCS
2009
IEEE
15 years 6 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...