Sciweavers

76 search results - page 6 / 16
» Adjacency stable connected operators and set levelings
Sort
View
DAM
2010
137views more  DAM 2010»
13 years 7 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
ICPP
2002
IEEE
14 years 11 days ago
Design and Evaluation of Scalable Switching Fabrics for High-Performance Routers
This work considers switching fabrics with distributed packet routing to achieve high scalability and low costs. The considered switching fabrics are based on a multistage structu...
Nian-Feng Tzeng, Ravi C. Batchu
CAD
2004
Springer
13 years 7 months ago
A multi-resolution topological representation for non-manifold meshes
We address the problem of representing and processing 3D objects, described through simplicial meshes, which consist of parts of mixed dimensions, and with a non-manifold topology...
Leila De Floriani, Paola Magillo, Enrico Puppo, Da...
PIMRC
2010
IEEE
13 years 5 months ago
Optimal transmission rate for ultra low-power receivers
In many wireless systems, the energy consumed by the receiver is significantly larger than the energy consumed by transmitter, possibly even by orders of magnitudes. This paper der...
J. H. C. van den Heuvel, Jean-Paul M. G. Linnartz,...
ICASSP
2010
IEEE
13 years 7 months ago
NC node selection game in collaborative streaming systems
Network coding has been recently proposed as an efficient method to improve throughput, minimize delays and remove the need for reconciliation between network nodes in distribute...
Nikolaos Thomos, Hyunggon Park, Eymen Kurdoglu, Pa...