19 search results - page 1 / 4 » Proximity Drawings: Three Dimensions Are Better than Two |
GD
1998
Springer
13 years 9 months ago
1998
Springer
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metr...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
IJCAI
2003
13 years 6 months ago
2003
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
GECCO
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we study the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) with different numbers of interpolation points. NEWUOA is a trust region method, ...