Sciweavers

5608 search results - page 307 / 1122
» On the Theory of Matchgate Computations
Sort
View
TRIER
2002
15 years 6 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl
IPMU
2010
Springer
15 years 5 months ago
Approximation of Data by Decomposable Belief Models
It is well known that among all probabilistic graphical Markov models the class of decomposable models is the most advantageous in the sense that the respective distributions can b...
Radim Jirousek
MTA
2010
108views more  MTA 2010»
15 years 5 months ago
A reduced-reference structural similarity approximation for videos corrupted by channel errors
Abstract In this paper we propose a reduced-reference quality assessment algorithm which computes an approximation of the Structural SIMilarity (SSIM) metrics exploiting coding too...
Marco Tagliasacchi, Giuseppe Valenzise, Matteo Nac...
PPSN
2010
Springer
15 years 5 months ago
Design and Comparison of two Evolutionary Approaches for Solving the Rubik's Cube
Solutions calculated by Evolutionary Algorithms have come to surpass exact methods for solving various problems. The Rubik’s Cube multiobjective optimization problem is one such ...
Nail El-Sourani, Markus Borschbach
SAB
2010
Springer
110views Optimization» more  SAB 2010»
15 years 5 months ago
How to Pick the Right One: Investigating Tradeoffs among Female Mate Choice Strategies in Treefrogs
Two main theories of female mate choice, that females either pick the best from the n closest males (best-of-n) or the closest with some minimum quality (min-threshold), make diffe...
Matthias Scheutz, Jack Harris, Sunny K. Boyd