496 search results - page 31 / 100 » Machine models and lower bounds for query processing |
177
Voted
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
110
Voted
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
139
Voted
COLT
1992
Springer
15 years 7 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
135
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
128
Voted
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...