Sciweavers

2060 search results - page 122 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
TIT
2008
90views more  TIT 2008»
14 years 9 months ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Gil Wiechman, Igal Sason
EACL
1993
ACL Anthology
14 years 11 months ago
A Tradeoff between Compositionality and Complexity in the Semantics of Dimensional Adjectives
Linguistic access to uncertain quantitative knowledge about physical properties is provided by dimensional adjectives, e.g. long-short in the spatial and temporal senses, near-far...
Geoffrey Simmons
ATAL
2005
Springer
15 years 3 months ago
An online POMDP algorithm for complex multiagent environments
In this paper, we present an online method for POMDPs, called RTBSS (Real-Time Belief Space Search), which is based on a look-ahead search to find the best action to execute at e...
Sébastien Paquet, Ludovic Tobin, Brahim Cha...
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
15 years 2 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
CSREAESA
2003
14 years 11 months ago
Impact of Code Compression on the Power Consumption in Embedded Systems
Future embedded systems (ES) will offer higher computation capacity than existing embedded systems. New applications of these ES require more and more memory resources and more an...
N. Kadri, S. Niar, A. R. Baba-Ali