Topic
Average-case complexity
About: Average-case complexity is a research topic. Over the lifetime, 1749 publications have been published within this topic receiving 44972 citations.
Papers published on a yearly basis
Papers
More filters
01 Jun 1998
TL;DR: Another Monte Carlo algorithm following from an original algorithm [4] is proposed and the average performance of the algorithm is polynomial and the probability that the algorithm fails to yield a correct answer for some data is less than e.g. less than 1%.
Abstract: Recently a randomized algorithm based on Davis and Putnam Procedure was designed in [16] for the purpose of solving the satisfiabilty problem. In this letter another Monte Carlo algorithm following from an original algorithm [4] is proposed. The average performance of the algorithm is polynomial and the probability that the algorithm fails to yield a correct answer for some data is less than e. Results are compared with those given in [16] and show an interesting performance for our algorithm.
1 citations
Proceedings Article•
01 Jan 1989
1 citations
26 Aug 2002
TL;DR: It is proven that Viterbi search achieves the minimum computational complexity with associated cost increasing in proportion to N/sup 3/ at a fixed event rate, where N is the block size of TD analysis.
Abstract: An optimized algorithm for a temporal decomposition (TD) model of speech is useful for very low-bit-rate speech coding in the context of voice storage applications. The event localizing task associated with the optimized TD is regarded as the major computational component of the algorithm. This paper provides a theoretical analysis of the computational complexity of the optimized TD algorithm which is important from an implementation point of view. Computational complexities of exhaustive, recursive, and Viterbi search techniques as applied to the event localizing task are analyzed. It is proven that Viterbi search achieves the minimum computational complexity with associated cost increasing in proportion to N/sup 3/ at a fixed event rate, where N is the block size of TD analysis. This result has a significant implication in selecting the block size for a practical implementation of the optimized TD algorithm.
1 citations
TL;DR: Simulation results show that the proposed ρ-domain frame-level R-D optimization algorithm can lower the computational complexity greatly with negligible variation in peak signal-to-noise ratio (PSNR) compared with GIA.
Abstract: The frame-level R-D optimization in H.264 is very important in video storage scenarios. Among all of the sub-optimal algorithms, a greedy iteration algorithm (GIA) can best lower the computational complexity of frame-level R-D optimization. In order to further lower the computational complexity, a ρ-domain frame-level R-D optimization algorithm is proposed in this letter. Different from GIA, every frame's rate and distortion can be estimated accurately without actual encoding in our proposed algorithm. Simulation results show that our proposed algorithm can lower the computational complexity greatly with negligible variation in peak signal-to-noise ratio (PSNR) compared with GIA.
1 citations