Sciweavers

806 search results - page 116 / 162
» Algebraic Structures of B-series
Sort
View
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 7 months ago
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
Venkatesan Guruswami, Alexander Vardy
JALC
2002
97views more  JALC 2002»
13 years 7 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
JUCS
2002
113views more  JUCS 2002»
13 years 7 months ago
The Origins and the Development of the ASM Method for High Level System Design and Analysis
: The research belonging to the Abstract State Machines approach to system design and analysis is surveyed and documented in an annotated ASM bibliography. The survey covers the pe...
Egon Börger
IGPL
2010
156views more  IGPL 2010»
13 years 6 months ago
Fusion of sequent modal logic systems labelled with truth values
Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calc...
João Rasga, Karina Roggia, Cristina Sernada...
GLOBECOM
2010
IEEE
13 years 5 months ago
Trusted Storage over Untrusted Networks
We consider distributed storage over two untrusted networks, whereby coding is used as a means to achieve a prescribed level of confidentiality. The key idea is to exploit the alge...
Paulo F. Oliveira, Luísa Lima, Tiago T. V. ...