Sciweavers

1080 search results - page 132 / 216
» Problem dependent optimization (PDO)
Sort
View
VLDB
2006
ACM
147views Database» more  VLDB 2006»
16 years 4 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
PODS
2003
ACM
113views Database» more  PODS 2003»
16 years 4 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
15 years 10 months ago
Variable discrimination of crossover versus mutation using parameterized modular structure
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...
Rob Mills, Richard A. Watson
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
15 years 5 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
15 years 4 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...