Sciweavers

536 search results - page 96 / 108
» The hardness and approximation algorithms for l-diversity
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
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 ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
CIKM
2003
Springer
14 years 9 days ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun
WSDM
2010
ACM
166views Data Mining» more  WSDM 2010»
14 years 4 months ago
Ranking Mechanisms in Twitter-Like Forums
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...
Anish Das Sarma, Atish Das Sarma, Sreenivas Gollap...
MIR
2010
ACM
264views Multimedia» more  MIR 2010»
14 years 1 months ago
Quest for relevant tags using local interaction networks and visual content
Typical tag recommendation systems for photos shared on social networks such as Flickr, use visual content analysis, collaborative filtering or personalization strategies to prod...
Neela Sawant, Ritendra Datta, Jia Li, James Ze Wan...
CIKM
2005
Springer
14 years 18 days ago
Towards estimating the number of distinct value combinations for a set of attributes
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
Xiaohui Yu, Calisto Zuzarte, Kenneth C. Sevcik