Sciweavers

193 search results - page 12 / 39
» Solving the multiple competitive facilities location problem
Sort
View
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 7 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 7 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...
ICPR
2010
IEEE
15 years 2 months ago
Finding Multiple Object Instances with Occlusion
In this paper we provide a framework of detection and localization of multiple similar shapes or object instances from an image based on shape matching. There are three challenges...
Ge Guo, Tingting Jiang, Yizhou Wang, Wen Gao
84
Voted
ICML
2010
IEEE
14 years 10 months ago
Simple and Efficient Multiple Kernel Learning by Group Lasso
We consider the problem of how to improve the efficiency of Multiple Kernel Learning (MKL). In literature, MKL is often solved by an alternating approach: (1) the minimization of ...
Zenglin Xu, Rong Jin, Haiqin Yang, Irwin King, Mic...
95
Voted
SPC
2005
Springer
15 years 3 months ago
On the Anonymity of Periodic Location Samples
As Global Positioning System (GPS) receivers become a common feature in cell phones, personal digital assistants, and automobiles, there is a growing interest in tracking larger us...
Marco Gruteser, Baik Hoh