Sciweavers

657 search results - page 93 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
AMW
2010
15 years 1 months ago
Multiresolution Cube Estimators for Sensor Network Aggregate Queries
In this work we present in-network techniques to improve the efficiency of spatial aggregate queries. Such queries are very common in a sensornet setting, demanding more targeted t...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 5 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
ICCV
2009
IEEE
16 years 4 months ago
Beyond Connecting the Dots: A Polynomial-time Algorithm for Segmentation and Boundary Estimation with Imprecise User Input
We propose a polynomial-time algorithm for segmentation and (open) boundary estimation which takes into account a series of user-specified attraction points. In contrast to exis...
Thomas Windheuser, Thomas Schoenemann, Daniel Crem...
ISAAC
2005
Springer
117views Algorithms» more  ISAAC 2005»
15 years 5 months ago
Basic Computations in Wireless Networks
Abstract. In this paper we address the problem of estimating the number of stations in a wireless network. Under the assumption that each station can detect collisions, we show tha...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
OPODIS
2010
14 years 9 months ago
Self-stabilizing Byzantine Asynchronous Unison,
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikh...