Sciweavers

545 search results - page 42 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 7 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
15 years 9 months ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
CVPR
2012
IEEE
13 years 6 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 5 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
JSS
2010
104views more  JSS 2010»
14 years 11 months ago
Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation
Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considere...
Shin Yoo, Mark Harman