Sciweavers

653 search results - page 37 / 131
» The size of minimum 3-trees
Sort
View
TCOM
2010
94views more  TCOM 2010»
14 years 10 months ago
Blind carrier phase acquisition and tracking for 8-VSB signals
—A blind carrier phase derotator can be employed to correct and track carrier phase offset either before or after equalization in a blind adaptive receiver. This work proposes a ...
Jenq-Tay Yuan, Yong-Fu Huang
CASES
2009
ACM
14 years 9 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
COMCOM
2010
118views more  COMCOM 2010»
14 years 9 months ago
Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks
This work considers the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). An efficient mini-slot scheduling needs to take into account the transmission o...
Jia-Ming Liang, Ho-Cheng Wu, Jen-Jee Chen, Yu-Chee...
MICCAI
2003
Springer
16 years 21 days ago
Progression Detection of Glaucoma from Polarimetric Images
Detecting glaucoma progression is crucial for assessing the effectivity of the treatment. This paper describes three methods for detecting progression related changes in polarimetr...
Koen Vermeer, N. J. Reus, Frans Vos, Hans Lemij, A...
SOFSEM
2010
Springer
15 years 6 months ago
On a Labeled Vehicle Routing Problem
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
Hatem Chatti, Laurent Gourvès, Jér&o...