Sciweavers

10988 search results - page 355 / 2198
» Algorithmic Folding Complexity
Sort
View
ICIP
2001
IEEE
16 years 6 months ago
N-dimensional zonal algorithms. The future of block based motion estimation?
The popularity of zonal based algorithms for block based motion estimation has been recently increasing due to their superior performance in both terms of reduced complexity and s...
Alexis M. Tourapis, Hye-Yeon Cheong, Ming L. Liou,...
CORR
2011
Springer
158views Education» more  CORR 2011»
14 years 12 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer
129
Voted
ICC
2007
IEEE
117views Communications» more  ICC 2007»
15 years 11 months ago
A Modified Bit-Flipping Decoding Algorithm for Low-Density Parity-Check Codes
― In this paper, a modified bit-flipping decoding algorithm for low-density parity-check (LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay...
Telex Magloire Nkouatchah Ngatched, Fambirai Takaw...
ASP
2005
Springer
15 years 10 months ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
15 years 9 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson