1952 search results - page 389 / 391 » Complete partitions of graphs |
92
Voted
JSAC
2007
14 years 11 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
101
click to vote
TROB
2002
14 years 11 months ago
2002
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
SOCINFO
2010
14 years 9 months ago
2010
As online social networks (OSN) attempt to mimic real life social networks, we have made progress towards using OSNs to provide us with data to allow for richer and more robust onl...
TVCG
2010
14 years 9 months ago
2010
— This paper presents topology-based methods to robustly extract, analyze, and track features defined as subsets of isosurfaces. First, we demonstrate how features identified b...