Sciweavers

206 search results - page 25 / 42
» Three Hoppy path problems and ternary paths
Sort
View
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Optimal packetization of VLC and convolution coded Markov sequences
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
Xiaohan Wang, Xiaolin Wu
ICC
2007
IEEE
139views Communications» more  ICC 2007»
13 years 11 months ago
Comparison of Protection Mechanisms: Capacity Efficiency and Recovery Time
High efficiency in capacity utilization and fast restoration are two primary goals of survivable design in optical networks. Shared backup path protection has been shown to be effi...
Wensheng He, Arun K. Somani
INFOCOM
2009
IEEE
14 years 2 months ago
ALDO: An Anomaly Detection Framework for Dynamic Spectrum Access Networks
—Dynamic spectrum access has been proposed as a means to share scarce radio resources, and requires devices to follow protocols that use resources in a proper, disciplined manner...
Song Liu, Yingying Chen, Wade Trappe, Larry J. Gre...
IWOCA
2010
Springer
232views Algorithms» more  IWOCA 2010»
13 years 2 months ago
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
Pinar Heggernes, Pim van 't Hof, Daniël Paulu...
IPL
2006
141views more  IPL 2006»
13 years 7 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan