Sciweavers

846 search results - page 13 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
ISSTA
2010
ACM
13 years 11 months ago
Strict control dependence and its effect on dynamic information flow analyses
Program control dependence has substantial impact on applications such as dynamic information flow tracking and data lineage tracing (a technique tracking the set of inputs that ...
Tao Bao, Yunhui Zheng, Zhiqiang Lin, Xiangyu Zhang...
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 7 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
FOCS
2003
IEEE
14 years 25 days ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
TPDS
2002
173views more  TPDS 2002»
13 years 7 months ago
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an...
Stephanie Lindsey, Cauligi S. Raghavendra, Krishna...
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