Sciweavers

840 search results - page 43 / 168
» The Complexity of the Extended GCD Problem
Sort
View
MST
2010
105views more  MST 2010»
13 years 6 months ago
On the Automatizability of Polynomial Calculus
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
Nicola Galesi, Massimo Lauria
CEC
2010
IEEE
12 years 11 months ago
Evoptool: An extensible toolkit for evolutionary optimization algorithms comparison
— This paper presents Evolutionary Optimization Tool (Evoptool), an optimization toolkit that implements a set of meta-heuristics based on the Evolutionary Computation paradigm. ...
Gabriele Valentini, Luigi Malagò, Matteo Ma...
IFIPTCS
2000
13 years 11 months ago
Hierarchical State Machines
Hierarchical state machines are finite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very l...
Mihalis Yannakakis
IPL
2008
99views more  IPL 2008»
13 years 7 months ago
A CKY parser for picture grammars
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
Stefano Crespi-Reghizzi, Matteo Pradella
ICASSP
2011
IEEE
12 years 11 months ago
Approximate nearest-subspace representations for sound mixtures
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
Paris Smaragdis