Results 191 to 200 of about 27,475 (219)
Exploiting the Endogenous Type II-A CRISPR-Cas System for Functional Engineering of Probiotic Lacticaseibacillus rhamnosus GG. [PDF]
Microb BiotechnolXie Z, Jin YS, Miller MJ.
europepmc +1 more source
Multimedia data-driven customer churn prediction using an enhanced extreme learning machine. [PDF]
Sci RepLiu YW, Wang J, Liu C.
europepmc +1 more source
Correlations in the EPR State Observables. [PDF]
Entropy (Basel)Orsini DF, Oliveira LRN, da Luz MGE.
europepmc +1 more source
Challenges of Intraoperative Documentation and Its Role in Patient Safety: An Integrative Review. [PDF]
Iran J Nurs Midwifery ResAkbari L, Aarabi A, Bahrami M.
europepmc +1 more source
Environmentally benign carbon nano dots as luminescence probe for quantification of palladium (II) chloride impurity in naproxen. [PDF]
BMC ChemKamal MF +3 more
europepmc +1 more source
The Modeling of a Single-Electron Bipolar Avalanche Transistor in 150 nm CMOS. [PDF]
Sensors (Basel)Boughedda A +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2016 IEEE International Conference on Image Processing (ICIP), 2016
In this paper, we propose a collection of pattern sets to compute bit-quad matchings in component tree structures of grayscale images. The proposed patterns are designed to be used in an efficient algorithm which runs in linear time by counting incrementally each pattern matching per pixel.
Dennis J. Silva +3 more
openaire +1 more source
In this paper, we propose a collection of pattern sets to compute bit-quad matchings in component tree structures of grayscale images. The proposed patterns are designed to be used in an efficient algorithm which runs in linear time by counting incrementally each pattern matching per pixel.
Dennis J. Silva +3 more
openaire +1 more source
On efficiency and properties of countable prefix codes
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2002The problem of decreasing the length function of two complete prefix countable codes proposed by Levenshtein (1968) is considered. A new recursive construction is presented which solves this problem in an asymptotic sense. The length function of prefix countable codes having a non-error propagation property is also investigated.
openaire +1 more source
On countable determination of the Kuratowski measure of noncompactness
Journal of Mathematical Analysis and Applications, 2021Xiaoling Chen, Lixin Cheng
exaly