Sciweavers

475 search results - page 28 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
IFIPTM
2009
171views Management» more  IFIPTM 2009»
13 years 5 months ago
Trust-Enhanced Recommender Systems for Efficient On-Line Collaboration
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...
Georgios Pitsilis
APVIS
2010
13 years 2 months ago
Visual analysis of high dimensional point clouds using topological landscapes
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...
Patrick Oesterling, Christian Heine, Heike Jä...
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 7 months ago
Efficient Clustering with Limited Distance Information
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 ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
TKDE
2008
234views more  TKDE 2008»
13 years 7 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
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...
Xiang Lian, Lei Chen 0002
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
14 years 7 months ago
Efficient type-ahead search on relational data: a TASTIER approach
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...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng