Results 51 to 60 of about 167,516,375 (307)
The location of the first maximum in the first sojourn of a Dyck path [PDF]
Analysis of ...
Helmut Prodinger
doaj +1 more source
Bayesianism: An Algorithmic Analysis
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin +2 more
wiley +1 more source
Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent [PDF]
In a barter exchange market, agents bring items and seek to exchange their items with one another. Agents may agree to a k-way exchange involving a cycle of k agents.
Timothy Highley, Hoang Le
doaj +1 more source
An analysis of a butterfly algorithm
Butterfly algorithms are an effective multilevel technique to compress discretizations of integral operators with highly oscillatory kernel functions. The particular version of the butterfly algorithm considered here realizes the transfer between levels by Chebyshev interpolation.
Steffen Börm +2 more
openaire +4 more sources
Performability analysis: a new algorithm [PDF]
Summary: We propose a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the algorithm.
Hédi Nabli, Bruno Sericola
openaire +1 more source
ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito +7 more
wiley +1 more source
Tight Euler tours in uniform hypergraphs - computational aspects [PDF]
By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices are computed ...
Zbigniew Lonc +2 more
doaj +1 more source
Analysis of a Cooperative Stereo Algorithm [PDF]
Marr and Poggio (1976) recently described a cooperative algorithm that solves the correspondence problem for stereopsis. This article uses a probabilistic technique to analyze the convergence of that algorithm, and derives the conditions governing the stability of the solution state.
Marr, D., Palm, G., Poggio, T.
openaire +3 more sources
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source

