Sciweavers

8080 search results - page 1344 / 1616
» Distributed Constrained Optimization
Sort
View
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 7 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 7 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
VLDB
2004
ACM
127views Database» more  VLDB 2004»
16 years 6 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
VLDB
2005
ACM
132views Database» more  VLDB 2005»
16 years 6 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
VLDB
2006
ACM
147views Database» more  VLDB 2006»
16 years 6 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
« Prev « First page 1344 / 1616 Last » Next »