Results 31 to 40 of about 29,853 (260)
Bipartite Perfect Matching in Pseudo-Deterministic NC
, 2017 We present a pseudo-deterministic NC algorithm for finding perfect matchings in bipartite graphs. Specifically, our algorithm is a randomized parallel algorithm which uses poly(n) processors, poly(log n) depth, poly(log n) random bits, and outputs for ...
Goldwasser, Shafi, Grossman, Ofer
core +2 more sources
Selective tuning of optical modes in a silicon comb-like photonic crystal cavity
Nanophotonics, 2019 Realizing multiply resonant photonic crystal cavities with large free spectral range is key to achieve integrated devices with highly efficient nonlinear response, such as frequency conversion, four-wave mixing, and parametric oscillation.
Clementi Marco +4 more
doaj +1 more source
Frontiers in Veterinary Science, 2016 Matching a person who is blind or visually impaired with a guide dog is a process of finding the most suitable guide dog available for that individual. Not all guide dog partnerships are successful, and the consequences of an unsuccessful partnership may
Janice Kathryn Foyer Lloyd +3 more
doaj +1 more source
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions [PDF]
, 2011 The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost‐perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by
Jia, Roger +7 more
core +1 more source
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs [PDF]
, 2023 In 1982 Papadimitriou and Yannakakis introduced the Exact Matching problem, in which given a red and blue edge-colored graph G and an integer k one has to decide whether there exists a perfect matching in G with exactly k red edges.
Dürr, Anita +3 more
core +1 more source
A Deterministic Parallel Algorithm for Bipartite Perfect Matching
, 2019 A fundamental quest in the theory of computing is to understand the power of randomness. It is not known whether every problem with an efficient randomized algorithm also has one that does not use randomness. One of the extensively studied problems under
Fenner, Stephen +2 more
core +1 more source
BMC Nursing, 2020 Background The Hospital Survey on Patient Safety Culture (HSOPSC) is widely utilized in multiple languages across the world. Despite culture and language variations, research studies from Latin America use the Spanish language HSOPSC validated for Spain ...
Patrick A. Palmieri +6 more
doaj +1 more source
FEBS Open Bio, EarlyView.Amino acids sequence of two different proteins with the same sequence (chameleon sequence—black boxes) represent in 3D structure of the proteins different secondary structures: HHHH—helical and BBB—Beta‐structural. The chains folded in water environment adopt different III‐order structures in which the chameleon fragments appear to adopt similar status
Irena Roterman +4 more
wiley +1 more source
A metamaterial electromagnetic energy rectifying surface with high harvesting efficiency
AIP Advances, 2016 A novel metamaterial rectifying surface (MRS) for electromagnetic energy capture and rectification with high harvesting efficiency is presented. It is fabricated on a three-layer printed circuit board, which comprises an array of periodic metamaterial ...
Xin Duan, Xing Chen, Lin Zhou
doaj +1 more source
YIPFα1A expression is regulated by multilayered molecular mechanisms
FEBS Open Bio, EarlyView.YIPFα1A, a five‐pass Golgi protein, is regulated at multiple layers. (1) Rare‐codon enrichment drives translation‐coupled mRNA decay. (2) A proximal 3′‐UTR element stabilizes mRNA. (3) A distal 3′‐UTR element included by alternate poly(A) site usage represses translation, which can be overridden by the proximal 3′‐UTR element.
Tokio Takaji +2 more
wiley +1 more source