Sciweavers

316 search results - page 42 / 64
» Bounded Depth Data Trees
Sort
View
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 9 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
ICDE
2009
IEEE
179views Database» more  ICDE 2009»
14 years 4 months ago
Self-Tuning, Bandwidth-Aware Monitoring for Dynamic Data Streams
— We present SMART, a self-tuning, bandwidth-aware monitoring system that maximizes result precision of continuous aggregate queries over dynamic data streams. While prior approa...
Navendu Jain, Praveen Yalagandula, Michael Dahlin,...
INFOCOM
2010
IEEE
13 years 7 months ago
Information Quality Aware Routing in Event-Driven Sensor Networks
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
Hwee-Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng ...
HICSS
2005
IEEE
172views Biometrics» more  HICSS 2005»
14 years 2 months ago
A Location Service Mechanism for Position-Based Multicasting in Wireless Mobile Ad hoc Networks
Abstract— In this paper we propose a novel location management scheme tailored for multicasting in Mobile Ad-hoc Networks (MANETs). We furthermore propose AMDLM, a locationbased ...
Yoav Sasson, David Cavin, André Schiper
PG
2002
IEEE
14 years 2 months ago
A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
Ioannis P. Ivrissimtzis, Christian Rössl, Han...