37 search results - page 4 / 8 » On the searchability of small-world networks with arbitrary ... |
SIGMETRICS
2011
ACM
12 years 9 months ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
STOC
2005
ACM
14 years 6 months ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
INFOCOM
2009
IEEE
14 years 28 days ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
IPPS
2007
IEEE
14 years 17 days ago
2007
IEEE
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...