Results 71 to 80 of about 36,366 (263)

The Complexity of the Greedoid Tutte Polynomial

open access: yesThe Electronic Journal of Combinatorics
We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of evaluating each of these polynomials at each fixed rational point $(x,y)$.
Knapp, C., Noble, S.
openaire   +3 more sources

Intelligent Orthopedics: Machine Learning in Diagnosis of Bone Disease, Implants, and Bone Health Monitoring

open access: yesAdvanced Healthcare Materials, EarlyView.
Efficient recovery from traumatic or degenerative diseases is a great challenge, even after all the advancements in bone and cartilage regeneration. Machine learning (ML) algorithms have presented opportunities to enhance these aspects by accurately analyzing imaging data.
Maryam Kamaei   +9 more
wiley   +1 more source

Lower Bound of the Complexity of Functions over Finite Field of Order 4 in the Class of Polarized Polynomials

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2016
The representations, including polynomial, of functions over final fields have been actively investigated. The complexity of such representations is the main stream of research.
A. Baliuk, A.S. Zinchenko
doaj  

Artificial Intelligence‐Assisted Workflow for Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling

open access: yesAdvanced Materials, EarlyView.
AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll   +19 more
wiley   +1 more source

Quantum Signal Processing and Quantum Singular Value Transformation on $U(N)$ [PDF]

open access: yesQuantum
Quantum signal processing and quantum singular value transformation are powerful tools to implement polynomial transformations of block-encoded matrices on quantum computers, and has achieved asymptotically optimal complexity in many prominent quantum ...
Xi Lu, Yuan Liu, Hongwei Lin
doaj   +1 more source

Quantum-inspired algorithm for general minimum conical hull problems

open access: yesPhysical Review Research, 2020
A wide range of fundamental machine learning tasks that are addressed by the maximum a posteriori estimation can be reduced to a general minimum conical hull problem.
Yuxuan Du   +3 more
doaj   +1 more source

Microscopic Insights into Magnetic Warping and Time‐Reversal Symmetry Breaking in Topological Surface States of Rare‐Earth‐Doped Bi2Te3

open access: yesAdvanced Materials, EarlyView.
Magnetic doping of the topological insulator Bi2Te3 with erbium adatoms induces out‐of‐plane magnetism and breaks time‐reversal symmetry, opening a Dirac gap and driving a Fermi surface transition from hexagonal to star‐of‐David geometry. Microscopy, spectroscopy, and magnetic dichroism reveal atomically controlled magnetic interactions that tailor the
Beatriz Muñiz Cano   +18 more
wiley   +1 more source

A Real-Valued Polynomial Rooting Method for Fast Direction of Arrival Estimation With Large Uniform Linear Arrays

open access: yesIEEE Access, 2019
When used for direction of arrival (DOA) estimation with large uniform linear arrays (ULAs), both root-MUSIC and unitary root-MUSIC (U-root-MUSIC) involve high-dimension eigenvalue decomposition (EVD) and high-degree polynomial rooting computations.
Feng-Gang Yan   +4 more
doaj   +1 more source

The Stirling Polynomial of a Simplicial Complex [PDF]

open access: yesDiscrete & Computational Geometry, 2005
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an appropriate generalized binomial coefficient. We prove that the face numbers of the barycentric subdivision of the free join of two CW-complexes may be found by multiplying the ...
openaire   +1 more source

Resistance to Overdoping Allows Over 2000 S cm−1 Conductivity in P(g3BTTT) With Anion‐Exchange Doping

open access: yesAdvanced Materials, EarlyView.
Anion‐exchange doping of conjugated polymers is an effective way to achieve high conductivities. Here, we report over 2000 S cm−1 electrical conductivity for doped P(g3BTTT). In addition, we show that P(g3BTTT) sustains exceptionally high doping levels without any drop in the charge mobility.
Basil Hunger   +14 more
wiley   +1 more source

Home - About - Disclaimer - Privacy