Sciweavers

633 search results - page 118 / 127
» Routing of structured queries in large-scale distributed sys...
Sort
View
102
Voted
CIKM
2010
Springer
14 years 8 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
ICDE
2006
IEEE
130views Database» more  ICDE 2006»
15 years 11 months ago
Warehousing and Analyzing Massive RFID Data Sets
Radio Frequency Identification (RFID) applications are set to play an essential role in object tracking and supply chain management systems. In the near future, it is expected tha...
Hector Gonzalez, Jiawei Han, Xiaolei Li, Diego Kla...
MOBIHOC
2002
ACM
15 years 9 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
INFOCOM
2000
IEEE
15 years 2 months ago
Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management
Abstract—In this paper, we present the implementation issues of a virtual backbone that supports the operations of the Uniform Quorum System (UQS) and the Randomized Database Gro...
Ben Liang, Zygmunt J. Haas
SENSYS
2003
ACM
15 years 2 months ago
Bluetooth and sensor networks: a reality check
The current generation of sensor nodes rely on commodity components. The choice of the radio is particularly important as it impacts not only energy consumption but also software ...
Martin Leopold, Mads Bondo Dydensborg, Philippe Bo...