511 search results - page 21 / 103 » Approximate Selection Queries over Imprecise Data |
156
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
174
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
162
click to vote
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
281
click to vote
ICDE
2009
IEEE
16 years 7 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
228
click to vote
SSD
2007
Springer
15 years 11 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...