Sciweavers

484 search results - page 13 / 97
» Computing Hilbert Class Polynomials
Sort
View
STACS
2007
Springer
14 years 1 months ago
VPSPACE and a Transfer Theorem over the Reals
Abstract. We introduce a new class VPSPACE of families of polynomials. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial spa...
Pascal Koiran, Sylvain Perifel
CADE
2008
Springer
13 years 9 months ago
Aligator: A Mathematica Package for Invariant Generation (System Description)
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
Laura Kovács
FOCM
2010
91views more  FOCM 2010»
13 years 6 months ago
On the Ranks and Border Ranks of Symmetric Tensors
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We...
J. M. Landsberg, Zach Teitler
ICML
1999
IEEE
14 years 8 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
SIAMAM
2008
170views more  SIAMAM 2008»
13 years 7 months ago
Absolute Stability and Complete Synchronization in a Class of Neural Fields Models
Neural fields are an interesting option for modelling macroscopic parts of the cortex involving several populations of neurons, like cortical areas. Two classes of neural field equ...
Olivier D. Faugeras, François Grimbert, Jea...