Sciweavers

727 search results - page 5 / 146
» Private approximation of search problems
Sort
View
WEBDB
2009
Springer
172views Database» more  WEBDB 2009»
14 years 4 months ago
PrivatePond: Outsourced Management of Web Corpuses
With the rise of cloud computing, it is increasingly attractive for end-users (organizations and individuals) to outsource the management of their data to a small number of larges...
Daniel Fabbri, Arnab Nandi, Kristen LeFevre, H. V....
INFOCOM
2002
IEEE
14 years 2 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
ICALP
2007
Springer
14 years 4 months ago
Constant-Round Private Database Queries
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
Nenad Dedic, Payman Mohassel
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
14 years 1 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
14 years 4 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...