688 search results - page 66 / 138 » General Partitioning on Random Graphs |
119
Voted
STOC
1992
ACM
15 years 4 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
118
click to vote
IMC
2010
ACM
14 years 10 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
136
Voted
JMLR
2010
14 years 7 months ago
2010
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
DAGSTUHL
2007
15 years 1 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
109
Voted
WWW
2010
ACM
15 years 21 days ago
2010
ACM
With the phenomenal success of networking sites (e.g., Facebook, Twitter and LinkedIn), social networks have drawn substantial attention. On online social networking sites, link r...