Filters
Sparsity of Shallow Networks Representing Finite Mappings
-valued functions on finite domains is investigated. Influence of sizes of function domains and of sizes dictionaries of computational units on sparsity of networks is not sufficiently large with ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Limitations of Shallow Networks Representing Finite Mappings
-valued functions on finite domains are investigated. Efficiency is studied in terms of computational units is not sufficiently large, computation of almost any uniformly randomly chosen function either re...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Peak functions on convex domains
This paper constructs continuous and Holder continuous peak functions on a bounded smooth convex domain of finite type in C^n. The construction uses Bergman kernel estimates....
BA - Obecná matematika
- 2000 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Complexity of Shallow Networks Representing Finite Mappings
Complexity of shallow (one-hidden-layer) networks representing finite of highdimensional Euclidean spaces, representation of almost any randomly chosen function on a sufficiently large domain by a shallow ...
IN - Informatika
- 2015 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Necessary conditions for local convexifiability of pseudoconvex domains in C^2
In this paper we give explicit necessary conditions for local convexifiability of a weakly pseudoconvex domain at a point of finite type....
BA - Obecná matematika
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
Time-Domain Finite Elements for Virtual Testing of Electromagnetic Compatibility
The paper presents a time-domain finite-element solver developed for simulations related to solving electromagnetic compatibility issues. The software to simulate a large class of problems. In the paper, the mathematical fo...
JA - Elektronika a optoelektronika, elektrotechnika
- 2013 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Probabilistic Lower Bounds for Approximation by Shallow Perceptron Networks
are investigated. Lower bounds on approximation errors are derived for binary-valued functions on finite domains. It is proven that unless the number of network units is sufficiently large (larger than any polynom...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
A modular extension of a finite element contact implementation
developing small strain contact algorithms in the 2D domain and their extension to largeThe structural mechanics module of the OOFEM finite element software has been to the 3D domain. After reviewing the current c...
Applied mechanics
- 2022 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
FETI domain decomposition method applied to solution of contact problem with large displacements
rates of a typical contact problem with large displacements and finite rotationsThe paper deals with application of the FETI (Finite Element and Interconnecting) method to finite element solution of contact proble...
BA - Obecná matematika
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
Limitations of One-Hidden-Layer Perceptron Networks
Limitations of one-hidden-layer perceptron networks to represent efficiently finite mappings is investigated. It is shown that almost any uniformly randomly chosen mapping on a sufficiently large finite domain<...
IN - Informatika
- 2015 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 181 828