916 search results - page 59 / 184 » Algorithm selection: a quantitative computation-intensive op... |
131
click to vote
VLDB
1991
ACM
15 years 6 months ago
1991
ACM
In this paper we present a technique to optimize queries on deductive databases that use aggregate operations such as min, max, and “largest Ic values.” Our approach is based ...
138
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
165
Voted
DASFAA
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
130
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a new, statistical approach to rule learning. Doing so, we address two of the problems inherent in traditional rule learning: The computational hardness of finding rule...
167
click to vote
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
—With the exponential growth in the amount of data that is being generated in recent years, there is a pressing need for applying machine learning algorithms to large data sets. ...