225 search results - page 42 / 45 » Stably Computable Properties of Network Graphs |
SIGCOMM
2010
ACM
13 years 7 months ago
2010
ACM
Recently, there has been much excitement in the research community over using social networks to mitigate multiple identity, or Sybil, attacks. A number of schemes have been propo...
PODC
2009
ACM
14 years 2 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
MOBISYS
2006
ACM
14 years 7 months ago
2006
ACM
In this paper we present a trace-driven framework capable of building realistic mobility models for the simulation studies of mobile systems. With the goal of realism, this framew...
QSHINE
2005
IEEE
14 years 29 days ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
P2PKM
2004
13 years 8 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...