A method for estimating unknown node positions in a sensor network based exclusively on connectivity-induced constraints is described. Known peer-to-peer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem

The method of conformal blocks for construction of global solutions in gravity for a twodimensional metric having one Killing vector field is described. A space-time in gravity models is a differentiable manifold which has to satisfy at least two requirements. Firstly, the Lorentz signature metric

node guarantees strong connectivity of the entire network and attains the global minimum energy solution for stationary networks. Due to its localized nature, this protocol proves to be self-reconfiguring and stays close to the minimum energy solution when applied to mobile networks. Simulation results

global optimality, and can be used to train SVM's over very large data sets. The main idea behind the decomposition is the iterative solution of sub-problems and the evaluation of optimality conditions which are used both to generate improved iterative values, and also establish the stopping

cuts are used to find the globally optimal segmentation of the N-dimensional image. The obtained solution gives the best balance of boundary and region properties among all segmentations satisfying the constraints. The topology of our segmentation is unrestricted and both “object” and “background

SVM solutions are unique and when they are global. We describe how support vector training can be practically implemented, and discuss in detail the kernel mapping technique which is used to construct SVM solutions which are nonlinear in the data. We show how Support Vector machines can have very

This paper examines the structure of option valuation problems and develops a new technique for their solution. It also introduces several jump and diffusion processes which have nol been used in previous models. The technique is applied lo these processes to find explicit option valuation formulas

In this paper we shall study a special class of solutions of the self-dual Yang-Mills equations. The original self-duality equations which arose in mathematical physics were defined on Euclidean 4-space. The physically relevant solutions were the ones with finite action—the so-called &apos

in clustering and Hough transform are demon-strated. Mean shift is also considered as an evolutionary strategy that performs multistart global optimization. Index Terms-Mean shift, gradient descent, global optimiza-tion, Hough transform, cluster analysis, k-means clustering. I.

This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference