Sciweavers

139 search results - page 3 / 28
» Computing crossing numbers in quadratic time
Sort
View
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 18 days ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
JCNS
2007
84views more  JCNS 2007»
13 years 5 months ago
Non-parametric detection of temporal order across pairwise measurements of time delays
Neuronal synchronization is often associated with small time delays, and these delays can change as a function of stimulus properties. Investigation of time delays can be cumbersom...
Danko Nikolic
CALC
2001
Springer
145views Cryptology» more  CALC 2001»
13 years 10 months ago
Fast Reduction of Ternary Quadratic Forms
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
Friedrich Eisenbrand, Günter Rote
AINA
2010
IEEE
13 years 11 months ago
A Quadratic, Complete, and Minimal Consistency Diagnosis Process for Firewall ACLs
— Developing and managing firewall Access Control Lists (ACLs) are hard, time-consuming, and error-prone tasks for a variety of reasons. Complexity of networks is constantly incr...
Sergio Pozo, A. J. Varela-Vaca, Rafael M. Gasca
ADCM
2007
100views more  ADCM 2007»
13 years 5 months ago
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphi
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
Evgeny Lipovetsky, Nira Dyn