475 search results - page 28 / 95 » Efficient Set Similarity Joins Using Min-prefixes |
220
click to vote
IFIPTM
2009
15 years 3 months ago
2009
Trust has been explored by many researchers in the past as a solution for assisting the process of recommendation production. In this work we are examining the feasibility of build...
198
click to vote
APVIS
2010
15 years 23 days ago
2010
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...
163
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
166
click to vote
TKDE
2008
15 years 5 months ago
2008
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
251
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...