Sciweavers

360 search results - page 31 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 11 months ago
Ranking queries on uncertain data: a probabilistic threshold approach
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
VLDB
2011
ACM
276views Database» more  VLDB 2011»
13 years 5 months ago
Ranking queries on uncertain data
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Xuemin Lin
NLDB
2007
Springer
14 years 5 months ago
Selecting Labels for News Document Clusters
This work deals with determination of meaningful and terse cluster labels for News document clusters. We analyze a number of alternatives for selecting headlines and/or sentences o...
Krishnaprasad Thirunarayan, Trivikram Immaneni, Ma...
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
15 years 6 days ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
ICDT
2001
ACM
116views Database» more  ICDT 2001»
14 years 3 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...