Sciweavers

58 search results - page 7 / 12
» Competitive Freshness Algorithms for Wait-Free Data Objects
Sort
View
SIROCCO
2007
13 years 9 months ago
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
In a sensor network the sensors, or nodes, obtain data and have to communicate these data to a central node. Because sensors are battery powered they are highly energy constrained....
Peter Korteweg, Alberto Marchetti-Spaccamela, Leen...
EUROPAR
2005
Springer
14 years 1 months ago
Dynamic Page Migration Under Brownian Motion
We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where ac...
Marcin Bienkowski, Miroslaw Korzeniowski
PAKDD
2004
ACM
137views Data Mining» more  PAKDD 2004»
14 years 29 days ago
Fast and Light Boosting for Adaptive Mining of Data Streams
Supporting continuous mining queries on data streams requires algorithms that (i) are fast, (ii) make light demands on memory resources, and (iii) are easily to adapt to concept dr...
Fang Chu, Carlo Zaniolo
EDBT
2010
ACM
135views Database» more  EDBT 2010»
14 years 2 months ago
Region-based online promotion analysis
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...
Tianyi Wu, Yizhou Sun, Cuiping Li, Jiawei Han
INFOCOM
2010
IEEE
13 years 6 months ago
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case
Abstract—We consider the power control problem in a timeslotted wireless channel, shared by a finite number of mobiles that transmit to a common base station. The channel betwee...
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, ...