266 search results - page 33 / 54 » On first-order topological queries |
PODS
1994
ACM
13 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Finding the right agents in a large and dynamic network to provide the needed resources in a timely fashion, is a long standing problem. This paper presents a method for informati...
SIGMETRICS
2005
ACM
14 years 1 months ago
2005
ACM
We present the initial results from our evaluation study on the performance implications of anycast in DNS, using four anycast servers deployed at top-level DNS zones. Our results...
DMSN
2004
ACM
14 years 1 months ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...