Results 21 to 30 of about 29,853 (260)
Scalable Surface-Code Decoders with Parallelization in Time
PRX Quantum, 2023 Fast classical processing is essential for most quantum fault-tolerance architectures. We introduce a sliding-window decoding scheme that provides fast classical processing for the surface code through parallelism.
Xinyu Tan +4 more
doaj +1 more source
Nanophotonics, 2023 Designing perfect anomalous reflectors is crucial for achieving many metasurface-based applications, but available design approaches for the cases of extremely large bending angles either require unrealistic gain–loss materials or rely on brute-force ...
Fang Zhening +6 more
doaj +1 more source
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
, 2007 The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +5 more
core +1 more source
Iraqi Geological Journal, 2023 Most of the productive oil fields around the world are water drive reservoirs where water influx has the potential to improve oil recovery considerably.
Herish Bibani, Ayad Al-haleem
doaj +1 more source
Applied Sciences, 2020 Various models were developed in the past to simulate different hydrological processes. However, discrepancies between simulated and observed values are still significant and pose a challenge to many researchers.
Andrej Vidmar +3 more
doaj +1 more source
East European Journal of Physics, 2023 The paper presents the results of numerical modeling of the electrodynamic characteristics of a Vivaldi type patch antenna based on a circular disk resonator. The modeling was carried out using the semi-open resonator model by the finite element method (
Sergey A. Pogarsky +2 more
doaj +1 more source
THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS
Forum of Mathematics, Sigma, 2015 Recently, settling a question of Erdős, Balogh, and Petříčková showed that there are at most $2^{n^{2}/8+o(n^{2})}$$n$-vertex maximal triangle-free graphs, matching the previously known lower bound.
JÓZSEF BALOGH +3 more
doaj +1 more source
Measurement Science Review, 2021 Numerous studies have shown that the choice of measurement strategy (number and position of measurement points) when measuring form error on a coordinate-measuring machine (CMM) depends on the characteristics of the machining process which was used to ...
Štrbac Branko +4 more
doaj +1 more source
Almost all Steiner triple systems have perfect matchings [PDF]
Proceedings of the London Mathematical Society, 2020 We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a Steiner triple system and show that almost all Steiner triple systems essentially attain this maximum.
openaire +3 more sources
Capacitive-loaded interstitial antenna for perfect matching
, 2018 A coaxial-cable capacitive-loaded interstitial antenna (CCIA) is proposed for 2.45 GHz. The capacitive load contributes to almost perfect matching and desirable heating area.
Myung, NH, Ahn, HR, Kim, B
core +2 more sources