24 search results - page 3 / 5 » New Lower Bounds For Orthogonal Drawings |
ISBRA
2009
Springer
13 years 11 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
SAC
2008
ACM
13 years 4 months ago
2008
ACM
For short-term forecasting of wind generation, a necessary step is to model the function for the conversion of meteorological variables (mainly wind speed) to power production. Su...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
COMPGEOM
2000
ACM
13 years 9 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...