627 search results - page 80 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
166
click to vote
AAAI
2010
15 years 7 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
181
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
In this paper, we study whether the need for efficient XML publishing brings any new requirements for relational query engines, or if sorting query results in the relational engin...
148
click to vote
TIP
2010
15 years 27 days ago
2010
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
176
click to vote
VLDB
1997
ACM
15 years 9 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
185
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
We present a parallel implementation of a probabilistic algorithm for real time tracking of segments in noisy edge images. Given an initial solution ?a set of segments that reason...