344 search results - page 48 / 69 » Random Walks on Colored Graphs |
64
Voted
ICPR
2010
IEEE
15 years 2 days ago
2010
IEEE
Social tagging is an increasingly popular way to describe and classify documents on the web. However, the quality of the tags varies considerably since the tags are authored freel...
113
Voted
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
87
Voted
JCO
2010
14 years 8 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...