Results 261 to 270 of about 1,062,165 (308)

The KWW Relaxation Spectrum Determination Using the Post-Widder Inversion Formula. [PDF]

Materials (Basel)
Stankiewicz A.
europepmc   +1 more source

Interdisciplinary Management of Maxillary Midline Diastema With a Papillary Penetrating Labial Frenum Using Orthodontic Therapy and Diode Laser-Assisted Frenectomy: A Case Report. [PDF]

Cureus
K S, Annadurai B, Km R, B Kudva P.
europepmc   +1 more source

Mathematical foundations of life, mind and all emergent phenomena. [PDF]

Front Syst Neurosci
Werbos PJ.
europepmc   +1 more source

Clip-with-line traction-assisted modified double-layered suturing closure for gastric endoscopic submucosal dissection defects. [PDF]

Endoscopy
Ozawa SI, Wakao S, Takeda K, Shirose D, Hiroyuki H, Fukasawa M.   +5 more
europepmc   +1 more source

An Upwind Interior Penalty DG Scheme for Solute Transport in 2D Variable-Order Mobile-Immobile Model. [PDF]

Entropy (Basel)
Wei L, Liu L, Zhang X.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Approximate Memory with Approximate DCT

Proceedings of the 2019 Great Lakes Symposium on VLSI, 2019
Approximate Computing is an emerging computing paradigm where one exploits inherent error resilience of certain applications (e.g., digital signal processing, multimedia and artificial intelligence) and trades off absolute computation precisions for performance, power, area, and/or efficiency gains.
Shenghou Ma, Paul Ampadu
openaire   +2 more sources

Approximate Sorting

Fundamenta Informaticae, 2006
We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n ^{2} /ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons in the worst case.
Joachim Giesen, Eva Schuberth, Milos Stojakovic   +2 more
openaire   +3 more sources