Sciweavers

80 search results - page 12 / 16
» The geometry and dynamics of binary trees
Sort
View
CEC
2010
IEEE
15 years 24 days ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
IPL
2010
114views more  IPL 2010»
14 years 10 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
COMPGEOM
2010
ACM
15 years 4 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
3DPVT
2006
IEEE
257views Visualization» more  3DPVT 2006»
15 years 5 months ago
3D from Line Segments in Two Poorly-Textured, Uncalibrated Images
This paper addresses the problem of camera selfcalibration, bundle adjustment and 3D reconstruction from line segments in two images of poorly-textured indoor scenes. First, we ge...
Herbert Bay, Andreas Ess, Alexander Neubeck, Luc J...
DGCI
2005
Springer
15 years 5 months ago
Algorithms for the Topological Watershed
The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,9] consists in modifying the original image by lowering...
Michel Couprie, Laurent Najman, Gilles Bertrand