Sciweavers

2799 search results - page 67 / 560
» The regenerator location problem
Sort
View
SIGKDD
2010
159views more  SIGKDD 2010»
13 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....
OR
2007
Springer
13 years 8 months ago
Hybrid heuristics for the probabilistic maximal covering location-allocation problem
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
Francisco de Assis Corrêa, Antonio Augusto C...
COR
2006
88views more  COR 2006»
13 years 8 months ago
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
F. Aykut Özsoy, Mustafa Ç. Pinar
CHI
2006
ACM
14 years 9 months ago
Peekaboom: a game for locating objects in images
We introduce Peekaboom, an entertaining web-based game that can help computers locate objects in images. People play the game because of its entertainment value, and as a side eff...
Luis von Ahn, Ruoran Liu, Manuel Blum
RECOMB
2008
Springer
14 years 9 months ago
Locating Multiple Gene Duplications through Reconciled Trees
We introduce the first exact and efficient algorithm for Guig?o et al.'s problem that, given a collection of rooted, binary gene trees and a rooted, binary species tree, deter...
J. Gordon Burleigh, Mukul S. Bansal, André ...