9 search results - page 2 / 2 » Grad and classes with bounded expansion I. Decompositions |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Bounds are derived on the noncoherent capacity of a very general class of multiple-input multiple-output fading channels that are selective in time and frequency as well as correla...
JUCS
2006
13 years 7 months ago
2006
: A sequence of increasing translation invariant subspaces can be defined by the Haar-system (or generally by wavelets). The orthogonal projection to the subspaces generates a deco...
SMA
2003
ACM
14 years 24 days ago
2003
ACM
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...