Sciweavers

2766 search results - page 131 / 554
» Algorithms for trigonometric polynomials
Sort
View
ICARIS
2009
Springer
15 years 8 months ago
Efficient Algorithms for String-Based Negative Selection
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...
Michael Elberfeld, Johannes Textor
111
Voted
JSC
2008
78views more  JSC 2008»
15 years 4 months ago
Rational Univariate Reduction via toric resultants
We describe algorithms for solving a given system of multivariate polynomial equations via the Rational Univariate Reduction (RUR). We compute the RUR from the toric resultant of ...
Koji Ouchi, John Keyser
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 4 months ago
New Set of Codes for the Maximum-Likelihood Decoding Problem
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
Morgan Barbier
108
Voted
GC
2002
Springer
15 years 3 months ago
The Hilbert Series of the Face Ring of a Flag Complex
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
Paul Renteln
TCS
2010
14 years 10 months ago
Non-confluence in divisionless P systems with active membranes
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
Antonio E. Porreca, Giancarlo Mauri, Claudio Zandr...