The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common spher...
The issue of multiuser cooperation in a complexity constrained noise-free CDMA channel is addressed. Multiuser cooperation is imperative if conventional demodulation is expected to...
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
Today, it is well understood that interference poses the main capacity limitation and thus challenge for future cellular networks. A promising concept that addresses interference i...
Fabian Diehm, Patrick Marsch, Gerhard Fettweis, Bh...
Efficient compression algorithms generally use wavelet transforms. They try to exploit all the signal dependencies that can appear inside and across the different sub-bands of th...