Sciweavers

142 search results - page 13 / 29
» Augmenting the connectivity of geometric graphs
Sort
View
STACS
2007
Springer
14 years 2 months ago
Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
Adrian Dumitrescu, Csaba D. Tóth
CCCG
2007
13 years 10 months ago
On a Geometric Approach to the Segment Sum Problem and Its Generalization
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
Asish Mukhopadhyay, Eugene Greene
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
A novel generative encoding for exploiting neural network sensor and output geometry
A significant problem for evolving artificial neural networks is that the physical arrangement of sensors and effectors is invisible to the evolutionary algorithm. For example,...
David B. D'Ambrosio, Kenneth O. Stanley
ISCI
2011
13 years 3 months ago
Augmented k-ary n-cubes
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional...
Yonghong Xiang, Iain A. Stewart
SIGIR
1998
ACM
14 years 25 days ago
Improved Algorithms for Topic Distillation in a Hyperlinked Environment
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity...
Krishna Bharat, Monika Rauch Henzinger