396 search results - page 44 / 80 » Crossing Numbers |
GD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
JSC
2010
14 years 6 months ago
2010
A Chebyshev knot C(a, b, c, ) is a knot which has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + ), where a, b, c are integers, Tn(t) is the Chebyshev pol...
79
Voted
BMCBI
2010
14 years 11 months ago
2010
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
100
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
APIN
2010
14 years 11 months ago
2010
Abstract. This paper introduces a robust variant of AdaBoost, cwAdaBoost, that uses weight perturbation to reduce variance error, and is particularly effective when dealing with da...