Sciweavers

444 search results - page 64 / 89
» Instance optimal query processing in spatial networks
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 9 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
DNIS
2005
Springer
112views Database» more  DNIS 2005»
14 years 1 months ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 23 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 8 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
CCGRID
2007
IEEE
14 years 2 months ago
Design of a Scalable Peer-to-Peer Information System Using the GT4 Index Service
Grid applications need efficient access to information about available resources and services. Typically, this access is provided by information services that are often organized ...
Shishir Bharathi, Ann L. Chervenak