Sciweavers

2981 search results - page 385 / 597
» Answer Set Planning
Sort
View
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 6 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
16 years 6 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
VLDB
2001
ACM
144views Database» more  VLDB 2001»
16 years 6 months ago
Approximate query processing using wavelets
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
Kaushik Chakrabarti, Minos N. Garofalakis, Rajeev ...
VLDB
2002
ACM
157views Database» more  VLDB 2002»
16 years 6 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
VLDB
2007
ACM
181views Database» more  VLDB 2007»
16 years 6 months ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...