Sciweavers

174 search results - page 8 / 35
» Algorithms for center and Tverberg points
Sort
View
WSC
2008
13 years 9 months ago
A simulation based scheduling model for call centers with uncertain arrival rates
In this paper we develop a two stage algorithm for scheduling call centers with strict SLAs and arrival rate uncertainty. The first cut schedule can be developed in less than a mi...
Thomas R. Robbins, Terry P. Harrison
COMPGEOM
2006
ACM
14 years 1 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
JGTOOLS
2008
53views more  JGTOOLS 2008»
13 years 7 months ago
Query Sphere Indexing for Neighborhood Requests
This is an algorithm for finding neighbors for point objects that can freely move and have no predefined position. The query sphere consists of a center location and a given radiu...
Nicolas Brodu
CIVR
2007
Springer
361views Image Analysis» more  CIVR 2007»
14 years 1 months ago
Interpretability based interest points detection
This paper deals with a new interest points detector. Unlike most standard detectors which concentrate on the local shape of the signal, the main objective of this new operator is...
Ahmed Rebai, Alexis Joly, Nozha Boujemaa
FSTTCS
2006
Springer
13 years 11 months ago
Normal and Feature Approximations from Noisy Point Clouds
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...
Tamal K. Dey, Jian Sun