Sciweavers

3177 search results - page 10 / 636
» Can We Have Confidence in a Tree Representation
Sort
View
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 7 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
14 years 7 months ago
Estimating the confidence of conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
Graham Cormode, Lukasz Golab, Flip Korn, Andrew Mc...
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
13 years 8 months ago
A tree-based GA representation for the portfolio optimization problem
Recently, a number of works have been done on how to use Genetic Algorithms to solve the Portfolio Optimization problem, which is an instance of the Resource Allocation problem cl...
Claus de Castro Aranha, Hitoshi Iba
SPAA
2009
ACM
14 years 8 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
HPCA
2008
IEEE
14 years 8 months ago
PaCo: Probability-based path confidence prediction
A path confidence estimate indicates the likelihood that the processor is currently fetching correct path instructions. Accurate path confidence prediction is critical for applica...
Kshitiz Malik, Mayank Agarwal, Vikram Dhar, Matthe...