176 search results - page 27 / 36 » Overhead analysis of query localization optimization and rou... |
CIDR
2007
13 years 8 months ago
2007
Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. Their maintenance cost is taken during database updates. In this paper, w...
PODS
2010
ACM
14 years 14 days ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
TMC
2008
13 years 7 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
DCOSS
2005
Springer
14 years 28 days ago
2005
Springer
In wireless sensor networks, energy and communication bandwidth are precious resources. Traditionally, layering has been used as a design principle for network stacks; hence routin...
ICCCN
2007
IEEE
14 years 1 months ago
2007
IEEE
—Several recent research activities have started to recognize the relevant role of k-hop clustering in Mobile Ad hoc NETworks (MANET) to effectively support many relevant tasks, ...