Sciweavers

817 search results - page 41 / 164
» Decoding Choice Encodings
Sort
View
EMNLP
2010
13 years 8 months ago
Efficient Incremental Decoding for Tree-to-String Translation
Syntax-based translation models should in principle be efficient with polynomially-sized search space, but in practice they are often embarassingly slow, partly due to the cost of...
Liang Huang, Haitao Mi
AAAI
2008
14 years 7 days ago
Decoding Wikipedia Categories for Knowledge Acquisition
This paper presents an approach to acquire knowledge from Wikipedia categories and the category network. Many Wikipedia categories have complex names which reflect human classific...
Vivi Nastase, Michael Strube
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 12 months ago
Corruption and Recovery-Efficient Locally Decodable Codes
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
David P. Woodruff
TCOM
2010
115views more  TCOM 2010»
13 years 8 months ago
New designs for bit-interleaved coded modulation with hard-decision feedback iterative decoding
—Bit-interleaved coded modulation (BICM) is often the method of choice for multilevel transmission over fading channels. If relatively simple forward error-correction (FEC) codes...
Alireza Kenarsari-Anhari, Lutz H.-J. Lampe
ICFP
2010
ACM
13 years 11 months ago
Functional pearl: every bit counts
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
Dimitrios Vytiniotis, Andrew Kennedy