Sciweavers

414 search results - page 34 / 83
» On discrete norms of polynomials
Sort
View
114
Voted
TNN
2008
112views more  TNN 2008»
15 years 12 days ago
Multilayer Perceptrons: Approximation Order and Necessary Number of Hidden Units
Abstract--This paper considers the approximation of sufficiently smooth multivariable functions with a multilayer perceptron (MLP). For a given approximation order explicit formula...
S. Trenn
ADG
2006
Springer
177views Mathematics» more  ADG 2006»
15 years 6 months ago
Recognition of Computationally Constructed Loci
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
Peter Lebmeir, Jürgen Richter-Gebert
100
Voted
CORR
2000
Springer
81views Education» more  CORR 2000»
15 years 10 days ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman
77
Voted
ICIP
2005
IEEE
16 years 2 months ago
Fourier transform for the spatial quincunx lattice
We derive a new, two-dimensional nonseparable signal transform for computing the spectrum of spatial signals residing on a finite quincunx lattice. The derivation uses the connect...
Markus Püschel, Martin Rötteler
81
Voted
DGCI
2006
Springer
15 years 4 months ago
Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
Isabelle Sivignon, David Coeurjolly