1332 search results - page 9 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
EDBT
2009
ACM
14 years 1 months ago
2009
ACM
The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries i...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...