966 search results - page 180 / 194 » Small Alliances in Graphs |
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
LADC
2007
Springer
14 years 1 months ago
2007
Springer
A distributed dynamic system is a fully distributed system subject to a continual arrival/departure of the entities deļ¬ning the system. Another characterizing dimension of these ...
WAIM
2007
Springer
14 years 1 months ago
2007
Springer
The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pag...
WAW
2007
Springer
14 years 1 months ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter Ī“ ā (0, 1), compute th...
WIOPT
2006
IEEE
14 years 1 months ago
2006
IEEE
ā This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...