Sciweavers

654 search results - page 54 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 6 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 3 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
MOBIHOC
2008
ACM
14 years 8 months ago
Improving sensor network immunity under worm attacks: a software diversity approach
Because of cost and resource constraints, sensor nodes do not have a complicated hardware architecture or operating system to protect program safety. Hence, the notorious buffer-o...
Yi Yang, Sencun Zhu, Guohong Cao
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
14 years 20 days 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
ICALP
2009
Springer
14 years 9 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...