Sciweavers

2031 search results - page 177 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 1 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
ICDE
2006
IEEE
176views Database» more  ICDE 2006»
14 years 9 months ago
Mondrian Multidimensional K-Anonymity
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 3 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
14 years 1 months ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
IPSN
2009
Springer
14 years 3 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...