Sciweavers

1599 search results - page 88 / 320
» Algorithms for Parity Games
Sort
View
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe
DATE
2004
IEEE
123views Hardware» more  DATE 2004»
15 years 3 months ago
On Concurrent Error Detection with Bounded Latency in FSMs
We discuss the problem of concurrent error detection (CED) with bounded latency in finite state machines (FSMs). The objective of this approach is to reduce the overhead of CED, a...
Sobeeh Almukhaizim, Petros Drineas, Yiorgos Makris
IJCAI
2003
15 years 1 months ago
Skewing: An Efficient Alternative to Lookahead for Decision Tree Induction
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...
David Page, Soumya Ray
TCOM
2008
75views more  TCOM 2008»
14 years 11 months ago
Fast performance estimation of block codes
Importance sampling is used in this paper to address the classical yet important problem of performance estimation of block codes. Simulation distributions that comprise discretean...
Rajan Srinivasan, Nuo Wang
TIT
2008
129views more  TIT 2008»
14 years 11 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir