Sciweavers

169 search results - page 21 / 34
» Counting paths in digraphs
Sort
View
TON
2010
125views more  TON 2010»
13 years 4 months ago
S4: Small State and Small Stretch Compact Routing Protocol for Large Static Wireless Networks
Routing protocols for large wireless networks must address the challenges of reliable packet delivery at increasingly large scales and with highly limited resources. Attempts to re...
Y. Mao, F. Wang, L. Qiu, S. Lam, J. Smith
ICA3PP
2009
Springer
14 years 2 months ago
Reliable Greedy Forwarding in Obstacle-Aware Wireless Sensor Networks
We present Obstacle-aware Virtual Circuit geographic Routing (OVCR), a novel routing mechanism for obstacle-aware wireless sensor networks that uses the obstacle-free path computed...
Ming-Tsung Hsu, Frank Yeong-Sung Lin, Yue-Shan Cha...
EMSOFT
2004
Springer
14 years 3 months ago
Binary translation to improve energy efficiency through post-pass register re-allocation
Energy efficiency is rapidly becoming a first class optimization parameter for modern systems. Caches are critical to the overall performance and thus, modern processors (both hig...
Kun Zhang, Tao Zhang, Santosh Pande
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 9 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella
TIT
2008
83views more  TIT 2008»
13 years 9 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck