Sciweavers

226 search results - page 43 / 46
» Parsing with the Shortest Derivation
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 6 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
TVCG
2011
136views more  TVCG 2011»
13 years 4 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
INFOCOM
2011
IEEE
13 years 1 months ago
Converge-cast with MIMO
—This paper investigates throughput and delay based on a newly predominant traffic pattern, called converge-cast, where each of the n nodes in the network act as a destination w...
Luoyi Fu, Yi Qin, Xinbing Wang, Xue Liu
SIGMETRICS
2011
ACM
229views Hardware» more  SIGMETRICS 2011»
13 years 22 days ago
Model-driven optimization of opportunistic routing
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...
Eric Rozner, Mi Kyung Han, Lili Qiu, Yin Zhang
SIGSOFT
2003
ACM
14 years 10 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...