1236 search results - page 10 / 248 » Prefix-Like Complexities and Computability in the Limit |
ICCS
2003
Springer
14 years 18 days ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
ECCTD
2011
12 years 7 months ago
2011
Abstract—In this paper, a low complexity algorithm for the design of a time-varying correction filter of finite impulse response (FIR) type is presented. Using the obtained fi...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
ICIP
2008
IEEE
14 years 9 months ago
2008
IEEE
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...