Sciweavers

1100 search results - page 165 / 220
» Approximate distance oracles
Sort
View
JUCS
2010
142views more  JUCS 2010»
14 years 8 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
FOCS
2010
IEEE
14 years 8 months ago
The Limits of Two-Party Differential Privacy
We study differential privacy in a distributed setting where two parties would like to perform analysis of their joint data while preserving privacy for both datasets. Our results ...
Andrew McGregor, Ilya Mironov, Toniann Pitassi, Om...
WINE
2010
Springer
149views Economy» more  WINE 2010»
14 years 7 months ago
Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
Dimitris Fotakis, Christos Tzamos
CDC
2010
IEEE
163views Control Systems» more  CDC 2010»
14 years 5 months ago
A projection framework for near-potential games
Potential games are a special class of games that admit tractable static and dynamic analysis. Intuitively, games that are "close" to a potential game should enjoy somewh...
Ozan Candogan, Asuman E. Ozdaglar, Pablo A. Parril...
CORR
2010
Springer
81views Education» more  CORR 2010»
14 years 5 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...