876 search results - page 65 / 176 » New Results for the Martin Polynomial |
ECCC
2010
13 years 7 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
ISBI
2007
IEEE
14 years 3 months ago
2007
IEEE
We present a novel method of statistical surface-based morphometry based on the use of non-parametric permutation tests and a spherical wavelet (SWC) shape representation. As an a...
VCIP
2003
13 years 10 months ago
2003
In this paper, we present a simple method to almost quadruple the spatial resolution of aliased images. From a set of four low resolution, undersampled and shifted images, a new i...
SYRCODIS
2007
13 years 10 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
JGO
2010
13 years 7 months ago
2010
A new and universal penalty method is introduced in this contribution. It is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm...