219 search results - page 16 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
132
click to vote
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
136
click to vote
CAAN
2007
Springer
15 years 5 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
116
click to vote
PE
2010
Springer
14 years 12 months ago
2010
Springer
We analyze the capacity scaling laws of wireless networks where the spatial distribution of nodes over the network area exhibits a high degree of clustering. In particular we cons...
105
click to vote
DCC
2010
IEEE
15 years 8 months ago
2010
IEEE
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...