Sciweavers

1067 search results - page 59 / 214
» Probabilistic regular graphs
Sort
View
108
Voted
AIRWEB
2007
Springer
15 years 6 months ago
Transductive Link Spam Detection
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
Dengyong Zhou, Chris Burges, Tao Tao
91
Voted
AI
2002
Springer
15 years 13 days ago
Emergence of social conventions in complex networks
The emergence of social conventions in multi-agent systems has been analyzed mainly in settings where every agent may interact either with every other agent or with nearest neighb...
Jordi Delgado
RANDOM
2001
Springer
15 years 5 months ago
Near-optimum Universal Graphs for Graphs with Bounded Degrees
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakaw...
TIT
2008
103views more  TIT 2008»
15 years 13 days ago
Improved Probabilistic Bounds on Stopping Redundancy
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
Junsheng Han, Paul H. Siegel, Alexander Vardy
KDD
2010
ACM
327views Data Mining» more  KDD 2010»
15 years 4 months ago
Cold start link prediction
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
Vincent Leroy, Berkant Barla Cambazoglu, Francesco...