Sciweavers

5608 search results - page 220 / 1122
» On the Theory of Matchgate Computations
Sort
View
APAL
2010
78views more  APAL 2010»
15 years 6 months ago
Extending and interpreting Post's programme
Computability theory concerns information with a causal
S. Barry Cooper
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 6 months ago
Unsupervised Learning of Morphology without Morphemes
The first morphological learner based upon the theory of Whole Word Morphology (Ford et al., 1997) is outlined, and preliminary evaluation results are presented. The program, Whol...
Sylvain Neuvel, Sean A. Fulop
DCG
2002
62views more  DCG 2002»
15 years 6 months ago
Degrees of Real Wronski Maps
We study the map which sends vectors of polynomials into their Wronski determinants. This defines a projection map of a Grassmann variety which we call a Wronski map. Our main res...
A. Eremenko, Andrei Gabrielov
IPL
2000
77views more  IPL 2000»
15 years 6 months ago
Simplified proof of the Fourier Sampling Theorem
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM...
Peter Høyer
IPL
2000
94views more  IPL 2000»
15 years 6 months ago
On rewrite constraints and context unification
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
Joachim Niehren, Sophie Tison, Ralf Treinen