Sciweavers

106 search results - page 20 / 22
» A formal study of information retrieval heuristics
Sort
View
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 7 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
WWW
2006
ACM
14 years 8 months ago
Retroactive answering of search queries
Major search engines currently use the history of a user's actions (e.g., queries, clicks) to personalize search results. In this paper, we present a new personalized service...
Beverly Yang, Glen Jeh
CIKM
2010
Springer
13 years 6 months ago
Preserving location and absence privacy in geo-social networks
Online social networks often involve very large numbers of users who share very large volumes of content. This content is increasingly being tagged with geo-spatial and temporal c...
Dario Freni, Carmen Ruiz Vicente, Sergio Mascetti,...
WWW
2010
ACM
14 years 2 months ago
Competing for users' attention: on the interplay between organic and sponsored search results
Queries on major Web search engines produce complex result pages, primarily composed of two types of information: organic results, that is, short descriptions and links to relevan...
Cristian Danescu-Niculescu-Mizil, Andrei Z. Broder...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs