Sciweavers

1096 search results - page 204 / 220
» Evaluating Algorithms for Concept Description
Sort
View
CVPR
2011
IEEE
13 years 2 months ago
action recognition by dense trajectories
Feature trajectories have shown to be efficient for representing videos. Typically, they are extracted using the KLT tracker or matching SIFT descriptors between frames. However,...
Heng Wang, Alexander Kläser, Cordelia Schmid, Che...
SIGIR
2012
ACM
11 years 10 months ago
Cognos: crowdsourcing search for topic experts in microblogs
Finding topic experts on microblogging sites with millions of users, such as Twitter, is a hard and challenging problem. In this paper, we propose and investigate a new methodolog...
Saptarshi Ghosh, Naveen Kumar Sharma, Fabrí...
KDD
2009
ACM
133views Data Mining» more  KDD 2009»
14 years 8 months ago
On the tradeoff between privacy and utility in data publishing
In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility o...
Tiancheng Li, Ninghui Li
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 7 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
WWW
2010
ACM
14 years 2 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii