Sciweavers

5180 search results - page 927 / 1036
» Concurrency, Time, and Constraints
Sort
View
TCS
2008
15 years 6 months ago
Bincoloring
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...
TCS
2008
15 years 6 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
TIT
2008
80views more  TIT 2008»
15 years 6 months ago
Entropy Amplification Property and the Loss for Writing on Dirty Paper
Costa's celebrated "writing on dirty paper" (WDP) shows that the powerconstrained channel Y = X + S + Z, with Gaussian Z, has the same capacity as the standard AWGN...
Aaron S. Cohen, Ram Zamir
TMC
2008
156views more  TMC 2008»
15 years 6 months ago
Rendezvous Planning in Wireless Sensor Networks with Mobile Elements
Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, the ...
Guoliang Xing, Tian Wang, Zhihui Xie, Weijia Jia
TMI
2008
116views more  TMI 2008»
15 years 6 months ago
Dynamic PET Reconstruction Using Wavelet Regularization With Adapted Basis Functions
Tomographic reconstruction from positron emission tomography (PET) data is an ill-posed problem that requires regularization. An attractive approach is to impose an 1-regularizatio...
J. Verhaeghe, Dimitri Van De Ville, I. Khalidov, Y...