Sciweavers

2430 search results - page 32 / 486
» Computing Tutte Polynomials
Sort
View
JSCIC
2008
59views more  JSCIC 2008»
13 years 7 months ago
Computing Derivatives of Noisy Signals Using Orthogonal Functions Expansions
In many applications noisy signals are measured. These signals has to be filtered and, sometimes, their derivative have to be computed. In this paper a method for filtering the si...
Adi Ditkowski, Abhinav Bhandari, Brian W. Sheldon
ISAAC
2009
Springer
93views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Computing Multidimensional Persistence
Abstract. The theory of multidimensional persistence captures the topology of a multifiltration – a multiparameter family of increasing spaces. Multifiltrations arise naturally...
Gunnar Carlsson, Gurjeet Singh, Afra Zomorodian
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 7 months ago
Settling the Complexity of Computing Two-Player Nash Equilibria
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
Xi Chen, Xiaotie Deng, Shang-Hua Teng
AAECC
2004
Springer
63views Algorithms» more  AAECC 2004»
13 years 7 months ago
Computation of the Decomposition Group of a Triangular Ideal
Abstract. This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generate...
I. Abdeljaouad-Tej, Sébastien Orange, Gu&ea...
MICS
2007
57views more  MICS 2007»
13 years 7 months ago
Pseudozero Set of Real Multivariate Polynomials
The pseudozero set of a system P of polynomials in n variables is the subset of Cn consisting of the union of the zeros of all polynomial systems Q that are near to P in a suitable...
Stef Graillat