Sciweavers

688 search results - page 56 / 138
» General Partitioning on Random Graphs
Sort
View
105
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
Multi-Functional Compression with Side Information
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
Soheil Feizi-Khankandi, Muriel Médard
123
Voted
AIRWEB
2007
Springer
15 years 6 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
15 years 20 days ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
CORR
2010
Springer
177views Education» more  CORR 2010»
15 years 16 days ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
IJSI
2008
91views more  IJSI 2008»
15 years 14 days ago
Random Event Structures
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
Manfred Droste, Guo-Qiang Zhang