Sciweavers

7758 search results - page 46 / 1552
» On the Number of Distributive Lattices
Sort
View
ACL
2009
13 years 6 months ago
Efficient Minimum Error Rate Training and Minimum Bayes-Risk Decoding for Translation Hypergraphs and Lattices
Minimum Error Rate Training (MERT) and Minimum Bayes-Risk (MBR) decoding are used in most current state-of-theart Statistical Machine Translation (SMT) systems. The algorithms wer...
Shankar Kumar, Wolfgang Macherey, Chris Dyer, Fran...
ICIP
2002
IEEE
14 years 10 months ago
Dirty-paper trellis codes for watermarking
Informed coding is the practice of representing watermark messages with patterns that are dependent on the cover Works. This requires the use of a dirty-paper code, in which each ...
Gwenaël J. Doërr, Ingemar J. Cox, Matthe...
ICASSP
2011
IEEE
13 years 12 days ago
Are all basis updates for lattice-reduction-aided MIMO detection necessary?
The question in the title is relevant when considering latticereduction-aided MIMO detectors, which achieve the same diversity as the maximum-likelihood detector while exhibiting ...
Brian Gestner, Xiaoli Ma, David V. Anderson
RELMICS
2005
Springer
14 years 2 months ago
Relational Correspondences for Lattices with Operators
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...
Jouni Järvinen, Ewa Orlowska
JPDC
2008
132views more  JPDC 2008»
13 years 8 months ago
Assurance of dynamic adaptation in distributed systems
Long running applications often need to adapt due to changing requirements or changing environment. Typically, such adaptation is performed by dynamically adding or removing compo...
Karun N. Biyani, Sandeep S. Kulkarni