71 search results - page 10 / 15 » Focused Crawling Using Context Graphs |
108
click to vote
SIGECOM
2006
ACM
15 years 7 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
132
Voted
ASIACRYPT
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
110
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
132
click to vote
JSAC
2008
15 years 1 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
112
Voted
BMCBI
2010
15 years 1 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...