Sciweavers

409 search results - page 13 / 82
» Odd Crossing Number and Crossing Number Are Not the Same
Sort
View
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
14 years 2 months ago
A Global k-Level Crossing Reduction Algorithm
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
14 years 27 days ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
ICC
2007
IEEE
123views Communications» more  ICC 2007»
14 years 1 months ago
Cross-Layer Optimization With Model-Based Parameter Exchange
— Cross-layer optimization (CLO) promises significant gains in comparison to a conventional system design, which does not allow for information exchange across layers. One of th...
Andreas Saul, Shoaib Khan, Gunther Auer, Wolfgang ...
CGF
2006
183views more  CGF 2006»
13 years 7 months ago
Cross Dissolve Without Cross Fade: Preserving Contrast, Color and Salience in Image Compositing
Linear interpolation is the standard image blending method used in image compositing. By averaging in the dynamic range, it reduces contrast and visibly degrades the quality of co...
Mark Grundland, Rahul Vohra, Gareth P. Williams, N...
ANTS
1998
Springer
139views Algorithms» more  ANTS 1998»
13 years 11 months ago
Generating Arithmetically Equivalent Number Fields with Elliptic Curves
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
Bart de Smit