The following pages link to TAG (Q32445):
Displaying 37 items.
- Towards a queueing-based framework for in-network function computation (Q373447) (← links)
- Accurate and precise aggregation counting (Q414868) (← links)
- Data-stream-based global event monitoring using pairwise interactions (Q436782) (← links)
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- Aggregate query processing in the presence of duplicates in wireless sensor networks (Q527209) (← links)
- Energy efficient monitoring in sensor networks (Q627527) (← links)
- Secure and highly-available aggregation queries in large-scale sensor networks via set sampling (Q658674) (← links)
- Adaptive holistic scheduling for query processing in sensor networks (Q666150) (← links)
- Efficient skyline query processing in wireless sensor networks (Q666158) (← links)
- Managing cohort movement of mobile sensors via GPS-free and compass-free node localization (Q666167) (← links)
- A note on efficient aggregate queries in sensor networks (Q868957) (← links)
- The price of validity in dynamic networks (Q878747) (← links)
- Spatially-decaying aggregation over a network (Q878748) (← links)
- Towards energy-efficient storage placement in large scale sensor networks (Q893857) (← links)
- Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks (Q897385) (← links)
- An analytical study of central and in-network data processing for wireless sensor networks (Q990109) (← links)
- Energy efficient randomised communication in unknown AdHoc networks (Q1029326) (← links)
- Summarizing numeric spatial data streams by trend cluster discovery (Q1711218) (← links)
- A state-based model of sensor protocols (Q1758154) (← links)
- Type-specialized staged programming with process separation (Q1929349) (← links)
- Sketching asynchronous data streams over sliding windows (Q1954256) (← links)
- From distributed coordination to field calculus and aggregate computing (Q2011213) (← links)
- LiMoSense: live monitoring in dynamic sensor networks (Q2256962) (← links)
- Efficient data reporting in intelligent transportation systems (Q2357919) (← links)
- Computation in networks of passively mobile finite-state sensors (Q2375293) (← links)
- Fault-tolerant aggregation: flow-updating meets mass-distribution (Q2401680) (← links)
- DHC: distributed, hierarchical clustering in sensor networks (Q2434537) (← links)
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks (Q2471714) (← links)
- Scale-free aggregation in sensor networks (Q2575090) (← links)
- Minimum-time aggregation scheduling in duty-cycled wireless sensor networks (Q2637250) (← links)
- Practical Fault-Tolerant Data Aggregation (Q2822685) (← links)
- Enforcing Availability in Failure-Aware Communicating Systems (Q2827467) (← links)
- Geometric algorithms for sensor networks (Q2889031) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- (Q5129944) (← links)
- Adaptive processing of historical spatial range queries in peer-to-peer sensor networks (Q5434470) (← links)
- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions (Q5964896) (← links)
