Sciweavers

720 search results - page 64 / 144
» Linear k-arboricities on trees
Sort
View
ICCAD
2001
IEEE
152views Hardware» more  ICCAD 2001»
14 years 5 months ago
Hybrid Structured Clock Network Construction
This paper hierarchically constructs a hybrid mesh/tree clock network structure consisting of overlying zero-skew clock meshes, with underlying zero-skew clock trees originating f...
Haihua Su, Sachin S. Sapatnekar
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
14 years 3 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
AFRIGRAPH
2006
ACM
14 years 2 months ago
Compression of dense and regular point clouds
We present a simple technique for single-rate compression of point clouds sampled from a surface, based on a spanning tree of the points. Unlike previous methods, we predict futur...
Bruce Merry, Patrick Marais, James E. Gain
GD
2004
Springer
14 years 2 months ago
Visualisation of Large and Complex Networks Using PolyPlane
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
Seok-Hee Hong, Tom Murtagh
ITP
2010
179views Mathematics» more  ITP 2010»
14 years 19 days ago
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
Peter Lammich, Andreas Lochbihler