Sciweavers

1108 search results - page 34 / 222
» Clustered Level Planarity
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...
IPPS
2007
IEEE
14 years 1 months ago
Runtime Optimization of Application Level Communication Patterns
— This paper introduces the Abstract Data and Communication Library (ADCL). ADCL is an application level communication library aiming at providing the highest possible performanc...
Edgar Gabriel, Shuo Huang
ICIP
2008
IEEE
14 years 2 months ago
Level set tracking with dynamical shape priors
Dynamical shape priors are curical for level set-based nonrigid object tracking with noise, occlusions or background clutter. In this paper, we propose a level set tracking framew...
Xue Zhou, Xi Li, Weiming Hu
IPPS
1998
IEEE
13 years 12 months ago
PULC: ParaStation User-Level Communication. Design and Overview
PULC is a user-level communication library for workstation clusters. PULC provides a multi-user, multi-programming communication library for user level communication on top of high...
Joachim M. Blum, Thomas M. Warschko, Walter F. Tic...
WAN
1998
Springer
13 years 11 months ago
ParaStation User Level Communication
PULC is a user-level communication library for workstation clusters. PULC provides a multi-user, multi-programming communication library for user level communication on top of high...
Joachim M. Blum, Thomas M. Warschko, Walter F. Tic...