Sciweavers

417 search results - page 42 / 84
» Orderings for Innermost Termination
Sort
View
ICC
2008
IEEE
197views Communications» more  ICC 2008»
14 years 2 months ago
V-BLAST Receiver and Performance In MIMO Relay Networks with Imperfect CSI
Abstract —Previous work demonstrated that the improvements in spectral efficiency and link reliability can be obtained in wireless relay networks employing terminals with MIMO c...
Jiansong Chen, Xiaoli Yu, C. C. Jay Kuo
RTA
2005
Springer
14 years 1 months ago
Leanest Quasi-orderings
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
Nachum Dershowitz, E. Castedo Ellerman
DOCENG
2004
ACM
14 years 1 months ago
Supervised learning for the legacy document conversion
We consider the problem of document conversion from the renderingoriented HTML markup into a semantic-oriented XML annotation defined by user-specific DTDs or XML Schema descrip...
Boris Chidlovskii, Jérôme Fuselier
WORDS
2002
IEEE
14 years 16 days ago
Auction System Design Using Open Multithreaded Transactions
Open Multithreaded Transactions form an advanced transaction model that provides features for controlling and structuring not only accesses to objects, as usual in transaction sys...
Jörg Kienzle, Alfred Strohmeier, Alexander B....
GLOBECOM
2009
IEEE
13 years 11 months ago
Adding Integrity Verification Capabilities to the LDPC-Staircase Erasure Correction Codes
File distribution is becoming a key technology, in particular in large scale content broadcasting systems like DVBH/SH. They largely rely on Application Level FEC codes (ALFEC) in ...
Mathieu Cunche, Vincent Roca