Sciweavers

27354 search results - page 4973 / 5471
» Distributed And Parallel Computing
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 7 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
OSDI
2004
ACM
16 years 7 months ago
CoDNS: Improving DNS Performance and Reliability via Cooperative Lookups
The Domain Name System (DNS) is a ubiquitous part of everyday computing, translating human-friendly machine names to numeric IP addresses. Most DNS research has focused on server-...
KyoungSoo Park, Vivek S. Pai, Larry L. Peterson, Z...
VLDB
2004
ACM
119views Database» more  VLDB 2004»
16 years 7 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
VLDB
2005
ACM
132views Database» more  VLDB 2005»
16 years 7 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 7 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 4973 / 5471 Last » Next »