Sciweavers

727 search results - page 7 / 146
» Private approximation of search problems
Sort
View
CCIA
2009
Springer
13 years 11 months ago
A Cryptographic Solution for Private Distributed Simple Meeting Scheduling
Meeting Scheduling is a suitable application for distributed computation, motivated by its privacy requirements. Previous work on this problem have considered some cryptographic te...
Javier Herranz, Stan Matwin, Pedro Meseguer, Jordi...
SIGMOD
2008
ACM
210views Database» more  SIGMOD 2008»
14 years 10 months ago
Private queries in location based services: anonymizers are not necessary
Mobile devices equipped with positioning capabilities (e.g., GPS) can ask location-dependent queries to Location Based Services (LBS). To protect privacy, the user location must n...
Gabriel Ghinita, Panos Kalnis, Ali Khoshgozaran, C...
FOCS
2008
IEEE
14 years 4 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
14 years 4 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
AAAI
2008
14 years 4 days ago
Physical Search Problems Applying Economic Search Models
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...
Yonatan Aumann, Noam Hazon, Sarit Kraus, David Sar...