Sciweavers

942 search results - page 77 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
CLA
2004
13 years 11 months ago
Planarity of Additively Drawn Concept Lattices
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
Christian Zschalig
WABI
2007
Springer
122views Bioinformatics» more  WABI 2007»
14 years 4 months ago
Algorithms for the Extraction of Synteny Blocks from Comparative Maps
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankof...
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
14 years 4 months ago
On the convergence time of distributed quantized averaging algorithms
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
Minghui Zhu, Sonia Martínez
ECEASST
2008
95views more  ECEASST 2008»
13 years 10 months ago
A Static Layout Algorithm for DiaMeta
Abstract: The diagram editor generator framework DIAMETA utilizes meta-modelbased language specifications and supports free-hand as well as structured editing. In this paper we pre...
Sonja Maier, Mark Minas
VIP
2000
13 years 11 months ago
A System for Graph Clustering Based on User Hints
This paper presents a system for graph clustering where users can visualize the clustering and give "hints" that help a computing method to find better solutions. Hints ...
Hugo A. D. do Nascimento, Peter Eades