Sciweavers

598 search results - page 102 / 120
» The Puzzle Layout Problem
Sort
View
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 7 months ago
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
Evanthia Papadopoulou
JGAA
2000
85views more  JGAA 2000»
13 years 7 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
NPL
2000
105views more  NPL 2000»
13 years 7 months ago
Online Interactive Neuro-evolution
In standard neuro-evolution, a population of networks is evolved in a task, and the network that best solves the task is found. This network is then fixed and used to solve future...
Adrian K. Agogino, Kenneth O. Stanley, Risto Miikk...
PPL
2000
110views more  PPL 2000»
13 years 7 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
INFOCOM
2010
IEEE
13 years 6 months ago
Bayesian Inference for Localization in Cellular Networks
—In this paper, we present a general technique based on Bayesian inference to locate mobiles in cellular networks. We study the problem of localizing users in a cellular network ...
Hui Zang, François Baccelli, Jean Bolot