Sciweavers

151 search results - page 12 / 31
» Minimizing Movement in Mobile Facility Location Problems
Sort
View
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
15 years 9 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
SIGKDD
2010
159views more  SIGKDD 2010»
14 years 7 months ago
Providing K-Anonymity in location based services
The offering of anonymity in relational databases has attracted a great deal of attention in the database community during the last decade [4]. Among the different solution appr...
Aris Gkoulalas-Divanis, Panos Kalnis, Vassilios S....
ICDM
2010
IEEE
121views Data Mining» more  ICDM 2010»
14 years 7 months ago
Recommending Social Events from Mobile Phone Location Data
A city offers thousands of social events a day, and it is difficult for dwellers to make choices. The combination of mobile phones and recommender systems can change the way one de...
Daniele Quercia, Neal Lathia, Francesco Calabrese,...
SIAMJO
2000
101views more  SIAMJO 2000»
14 years 9 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
ICCCN
2007
IEEE
14 years 9 months ago
Dual-Sink: Using Mobile and Static Sinks for Lifetime Improvement in Wireless Sensor Networks
—Mobile sink has been adopted by many schemes for lifetime improvement in wireless sensor networks. It is necessary to propagate the topological or location changes caused by the...
Xiaobing Wu, Guihai Chen