Sciweavers

8917 search results - page 1604 / 1784
» Abstraction in Algorithm Animation
Sort
View
136
Voted
CORR
2008
Springer
117views Education» more  CORR 2008»
15 years 2 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan
ET
2010
98views more  ET 2010»
15 years 2 months ago
MONSOON: SAT-Based ATPG for Path Delay Faults Using Multiple-Valued Logics
Abstract As technology scales down into the nanometer era, delay testing of modern chips has become more and more important. Tests for the path delay fault model are widely used to...
Stephan Eggersglüß, Görschwin Fey,...
FOCM
2010
108views more  FOCM 2010»
15 years 2 months ago
Parallelization Method for a Continuous Property
Abstract. An automated method of general purpose is introduced for computing a rigorous estimate of a bounded region in Rn whose points satisfy a given property. The method is base...
Pawel Pilarczyk
FS
2010
105views more  FS 2010»
15 years 2 months ago
Local time and the pricing of time-dependent barrier options
Abstract A time-dependent double-barrier option is a derivative security that delivers the terminal value φ(ST ) at expiry T if neither of the continuous time-dependent barriers b...
Aleksandar Mijatovic
128
Voted
FUIN
2010
89views more  FUIN 2010»
15 years 2 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
« Prev « First page 1604 / 1784 Last » Next »