525 search results - page 2 / 105 » Improved Circular Layouts |
GD
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
SODA
1997
ACM
13 years 6 months ago
1997
ACM
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
DCG
2006
13 years 5 months ago
2006
We use circular sequences to give an improved lower bound on the minimum number of ( k)
CIMCA
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we analyse the properties of the standard circular hidden Markov model (HMM) on 2D shape recognition. We point out the limitations of the circular HMMs and further ...
BMCBI
2008
13 years 5 months ago
2008
Background: A number of sequence-based methods exist for protein secondary structure prediction. Protein secondary structures can also be determined experimentally from circular d...