Sciweavers

108 search results - page 22 / 22
» Cover Trees for Nearest Neighbor
Sort
View
115
Voted
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 11 months ago
Differentially Private Approximation Algorithms
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...
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
14 years 11 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...
COMCOM
2006
147views more  COMCOM 2006»
15 years 1 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das