Sciweavers

2638 search results - page 341 / 528
» Random Geometric Complexes
Sort
View
ICALP
2005
Springer
16 years 8 hour ago
Facility Location in Sublinear Time
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian...
ATAL
2004
Springer
15 years 12 months ago
Towards a Formal Approach to Overhearing: Algorithms for Conversation Identification
Overhearing is gaining attention as a generic method for cooperative monitoring of distributed, open, multiagent systems. It involves monitoring the routine conversations of agent...
Gery Gutnik, Gal A. Kaminka
CP
2004
Springer
15 years 12 months ago
Statistical Regimes Across Constrainedness Regions
Abstract. Much progress has been made in terms of boosting the effectiveness of backtrack style search methods. In addition, during the last decade, a much better understanding of ...
Carla P. Gomes, Cèsar Fernández, Bar...
ICTAI
2003
IEEE
15 years 11 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
ESA
2003
Springer
118views Algorithms» more  ESA 2003»
15 years 11 months ago
The Voronoi Diagram of Planar Convex Objects
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
Menelaos I. Karavelas, Mariette Yvinec