Sciweavers

402 search results - page 63 / 81
» Hiding Location Information from Location-Based Services
Sort
View
WWW
2009
ACM
14 years 8 months ago
Spatio-temporal models for estimating click-through rate
We propose novel spatio-temporal models to estimate clickthrough rates in the context of content recommendation. We track article CTR at a fixed location over time through a dynam...
Deepak Agarwal, Bee-Chung Chen, Pradheep Elango
CCS
2007
ACM
14 years 2 months ago
How much anonymity does network latency leak?
Low-latency anonymity systems such as Tor, AN.ON, Crowds, and Anonymizer.com aim to provide anonymous connections that are both untraceable by “local” adversaries who control ...
Nicholas Hopper, Eugene Y. Vasserman, Eric Chan-Ti...
TIT
2008
164views more  TIT 2008»
13 years 7 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
SIGSOFT
2008
ACM
14 years 8 months ago
Extended exceptions for contingencies and their implications for the engineering process
We observed a general problem of sequential programs, which often results in design and programming errors in industrial software engineering projects, and propose a solution appr...
Thorsten van Ellen, Wilhelm Hasselbring
CCR
2006
110views more  CCR 2006»
13 years 8 months ago
Estimating network proximity and latency
Network proximity and latency estimation is an important component in discovering and locating services and applications. With the growing number of services and service providers...
Puneet Sharma, Zhichen Xu, Sujata Banerjee, Sung-J...