Sciweavers

1091 search results - page 18 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
14 years 1 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
LION
2007
Springer
113views Optimization» more  LION 2007»
14 years 1 months ago
Limited-Memory Techniques for Sensor Placement in Water Distribution Networks
Abstract. The practical utility of optimization technologies is often impacted by factors that reflect how these tools are used in practice, including whether various real-world c...
William E. Hart, Jonathan W. Berry, Erik G. Boman,...
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 8 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
IROS
2007
IEEE
116views Robotics» more  IROS 2007»
14 years 2 months ago
Optimal distributed planning of multi-robot placement on a 3D truss
— This paper considers the problem of allocating tasks among robots that operate on a 3D truss. Each robot is commanded to navigate to a different location for work. When the inf...
Seung-kook Yun, Daniela Rus
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
14 years 9 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas