Sciweavers

96 search results - page 2 / 20
» Large Quasi-Tree Drawing: A Neighborhood Based Approach
Sort
View
COMGEO
2004
ACM
13 years 5 months ago
A multi-dimensional approach to force-directed layouts of large graphs
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...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
JGAA
2007
93views more  JGAA 2007»
13 years 5 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
CVPR
2011
IEEE
12 years 9 months ago
Reconstruction of relief objects from line drawings
This paper addresses the problem of automatic reconstruction of a 3D relief from a line drawing on top of a given base object. Reconstruction is challenging due to four reasons â€...
Michael Kolomenkin, George Leifman, Ilan Shimshoni...
BMCBI
2007
134views more  BMCBI 2007»
13 years 5 months ago
Nearest Neighbor Networks: clustering expression data based on gene neighborhoods
Background: The availability of microarrays measuring thousands of genes simultaneously across hundreds of biological conditions represents an opportunity to understand both indiv...
Curtis Huttenhower, Avi I. Flamholz, Jessica N. La...
HM
2009
Springer
165views Optimization» more  HM 2009»
13 years 10 months ago
Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search
Abstract. A Video-on-Demand system usually consists of a large number of independent video servers. In order to utilize network resources as efficiently as possible the overall net...
Jakob Walla, Mario Ruthmair, Günther R. Raidl