Sciweavers

6142 search results - page 631 / 1229
» The Complexity of Partition Functions
Sort
View
ICIP
1994
IEEE
16 years 8 months ago
Discrete-Cosine/Sine-Transform Based Motion Estimation
A new motion estimation scheme, Discrete-Cosine/SineTransform Based Motion Estimation (DXT-ME) utilizing the principle of orthogonality of cosine and sine functions to estimate, i...
Ut-Va Koc, K. J. Ray Liu
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 7 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
16 years 4 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
16 years 1 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
ICANNGA
2009
Springer
203views Algorithms» more  ICANNGA 2009»
16 years 1 months ago
NEAT in HyperNEAT Substituted with Genetic Programming
In this paper we present application of genetic programming (GP) [1] to evolution of indirect encoding of neural network weights. We compare usage of original HyperNEAT algorithm w...
Zdenek Buk, Jan Koutník, Miroslav Snorek