792 search results - page 109 / 159 » Computing Iceberg Queries Efficiently |
143
Voted
TKDE
2008
15 years 3 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
134
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...
146
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Modeling and recognizing landmarks at world-scale is a
useful yet challenging task. There exists no readily available
list of worldwide landmarks. Obtaining reliable visual
mode...
142
Voted
SIGMOD
2003
ACM
16 years 3 months ago
2003
ACM
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
120
Voted
SODA
2010
ACM
16 years 28 days ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...