Results 171 to 180 of about 13,417,881 (325)
A General Approach to Dropout in Quantum Neural Networks
Advanced Quantum Technologies, EarlyView., 2023 Randomly dropping artificial neurons and all their connections in the training phase reduces overfitting issues in classical neural networks, thus improving performances on previously unseen data. The authors introduce different dropout strategies applied to quantum neural networks, learning models based on parametrized quantum circuits.
Francesco Scala +3 more
wiley +1 more source
Analysis of image formation in optical palpation
Journal of Biophotonics, EarlyView.Optical palpation is an emerging elastography technique that generates images of mechanical stress at the tissue surface, with applications in intraoperative cancer detection. Image formation is simulated using finite element analysis and validated with experiments on silicone phantoms, providing an analysis of trends in detectability, feature ...
R. Jones, Q. Fang, B. F. Kennedy
wiley +1 more source
Benefits of Open Quantum Systems for Quantum Machine Learning
Advanced Quantum Technologies, EarlyView., 2023 Quantum machine learning (QML), poised to transform data processing, faces challenges from environmental noise and dissipation. While traditional efforts seek to combat these hindrances, this perspective proposes harnessing them for potential advantages. Surprisingly, under certain conditions, noise and dissipation can benefit QML.
María Laura Olivera‐Atencio +2 more
wiley +1 more source
A Sharper Ramsey Theorem for Constrained Drawings
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G $G$ and a collection C ${\mathscr{C}}$ of subsets of Rd ${{\mathbb{R}}}^{d}$ indexed by the subsets of vertices of G $G$, a constrained drawing of G $G$ is a drawing where each edge is drawn inside some set from C ${\mathscr{C}}$, in such a way that nonadjacent edges are drawn in sets with disjoint indices.
Pavel Paták
wiley +1 more source
Two Proofs of a Theorem on Algebraic Groups [PDF]
, 1951 Catherine Chevalley, E. R. Kolchin
openalex +1 more source
Edge‐Connectivity Between Edge‐Ends of Infinite Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In infinite graph theory, the notion of ends, first introduced by Freudenthal and Jung for locally finite graphs, plays an important role when generalizing statements from finite graphs to infinite ones. Nash‐Williams' Tree‐Packing Theorem and MacLane's Planarity Criteria are examples of results that allow a topological approach, in which ends
Leandro Aurichi, Lucas Real
wiley +1 more source
European Journal of Personality, EarlyView., 2020 Abstract This study explored the validity of person judgements by targets and their acquaintances (‘informants’) in longitudinally predicting a broad range of psychologically meaningful life experiences. Judgements were gathered from four sources (targets, N = 189; and three types of informants, N = 1352), and their relative predictive validity was ...
Nele M. Wessels +3 more
wiley +1 more source
The Fundamental Group of the Principal Component of a Commutative Banach Algebra [PDF]
, 1953 Edward K. Blum
openalex +1 more source
The Generic Circular Triangle‐Free Graph
Journal of Graph Theory, EarlyView.ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 ${{\mathbb{C}}}_{3}$ and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G $G$ embeds into C 3 ${{\mathbb{C}}}_{3}$ if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 } $\{{K}_{3},{K}_{1}+2{
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley +1 more source