Sciweavers

631 search results - page 10 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
COMPGEOM
2011
ACM
12 years 11 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 3 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
ICDT
2011
ACM
232views Database» more  ICDT 2011»
12 years 11 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...
LPNMR
2011
Springer
12 years 10 months ago
Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems
Abstract. Multi-context systems are a formalism to interlink decentralized and heterogeneous knowledge based systems (contexts), which interact via (possibly nonmonotonic) bridge r...
Thomas Eiter, Michael Fink, Peter Schüller