Sciweavers

499 search results - page 15 / 100
» On the Decay of Crossing Numbers
Sort
View
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
14 years 3 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 1 months 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...
CGF
2006
183views more  CGF 2006»
13 years 8 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...
DAC
1995
ACM
13 years 11 months ago
Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
Yu-Liang Wu, Malgorzata Marek-Sadowska
HICSS
2009
IEEE
116views Biometrics» more  HICSS 2009»
14 years 2 months ago
Digital Cross-Organizational and Cross-Border Collaboration: A Scientometric Study
Digital cross-organizational and cross-border collaboration are emerging research issues. Significant drivers of this development are collaboration-related information systems. A ...
Maria Madlberger, Narcyz Roztocki