Search Sciweavers | Sciweavers

344 search results - page 10 / 69

» Random Walks on Colored Graphs

click to vote

CIKM
2008
Springer

166views Information Technology» more CIKM 2008»

A random walk on the red carpet: rating movies with user reviews and pagerank

13 years 9 months ago

Download dblab.cs.nccu.edu.tw

Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...

Derry Tanti Wijaya, Stéphane Bressan

claim paper

Read More »

click to vote

STOC
2002
ACM

121views Algorithms» more STOC 2002»

Almost all graphs with average degree 4 are 3-colorable

14 years 8 months ago

Download users.soe.ucsc.edu

We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...

Dimitris Achlioptas, Cristopher Moore

claim paper

Read More »

click to vote

WOWMOM
2009
ACM

143views Multimedia» more WOWMOM 2009»

Improving partial cover of Random Walks in large-scale Wireless Sensor Networks

14 years 2 months ago

Download cgi.di.uoa.gr

Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...

Leonidas Tzevelekas, Ioannis Stavrakakis

claim paper

Read More »

click to vote

FOCS
1995
IEEE

101views Theoretical Computer Science» more FOCS 1995»

Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time

13 years 11 months ago