364 search results - page 61 / 73 » Computing Communities in Large Networks Using Random Walks |
111
click to vote
EDBT
2004
ACM
15 years 9 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
IWCMC
2010
ACM
15 years 2 months ago
2010
ACM
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
109
click to vote
P2PKM
2004
14 years 10 months ago
2004
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers per...
CP
2005
Springer
15 years 3 months ago
2005
Springer
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
175
click to vote
POPL
2007
ACM
15 years 9 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...