839 search results - page 162 / 168 » Algorithms for Index-Assisted Selectivity Estimation |
115
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
112
Voted
KDD
2006
ACM
16 years 23 days ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
118
click to vote
IMC
2006
ACM
15 years 6 months ago
2006
ACM
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
131
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
174
click to vote
VLDB
2007
ACM
16 years 18 days ago
2007
ACM
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...