Results 231 to 240 of about 866,547 (282)

Colloidal Heterostructures Enable Interfacial Transport of Immiscible Molecules in Printable Organohydrogels

Advanced Materials, EarlyView.
Multiphase printable organohydrogels with tunable microstructures are developed to control molecular transport pathways for immiscible cargo. The tortuosity and domain size of the colloidal phases are tuned by adjusting temperature and shear during processing, which enables the tailoring of diffusion kinetics due to different transport pathways.
Riley E. Dowdy‐Green, Rony Waheibi, Nazanin Shakoury, Yuemei Ye, Lilian C. Hsiao   +4 more
wiley   +1 more source

Tumor-immune partitioning and clustering algorithm for identifying tumor-immune cell spatial interaction signatures within the tumor microenvironment. [PDF]

PLoS Comput Biol
Lau MC, Borowsky J, Väyrynen JP, Haruki K, Zhao M, Dias Costa A, Gu S, da Silva A, Ugai T, Arima K, Nguyen MN, Takashima Y, Yeong J, Tai D, Hamada T, Lennerz JK, Fuchs CS, Wu CJ, Meyerhardt JA, Ogino S, Nowak JA.   +20 more
europepmc   +1 more source

The Improvement of Density Peaks Clustering Algorithm and Its Application to Point Cloud Segmentation of LiDAR. [PDF]

Sensors (Basel)
Wang Z, Fang X, Jiang Y, Ji H, Wang B, Huang Z.   +5 more
europepmc   +1 more source

An online clustering algorithm predicting model for prostate cancer based on PHI-related variables and PI-RADS in different PSA populations. [PDF]

Cancer Cell Int
Hu J, Miao Q, Ren J, Su H, Zhang X, Bi J, Zhang G.   +6 more
europepmc   +1 more source

Distribution network line loss analysis method based on improved clustering algorithm and isolated forest algorithm. [PDF]

Sci Rep
Li J, Li S, Zhao W, Li J, Zhang K, Jiang Z.   +5 more
europepmc   +1 more source

Predicting Recovery Following Total Hip and Knee Arthroplasty Using a Clustering Algorithm. [PDF]

Arthroplast Today
Halvorson RT, Torres-Espin A, Cherches M, Callahan M, Vail TP, Bailey JF.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Fast Clustering Algorithms

ORSA Journal on Computing, 1994
This paper considers the problem of partitioning the vertices of a weighted complete graph into cliques of unbounded size and number, such that the sum of the edge weights of all cliques is maximized. The problem is known as the clique-partitioning problem and arises as a clustering problem in qualitative data analysis.
Dorndorf, Ulrich, Pesch, Erwin
openaire   +1 more source

Genetic clustering algorithms

European Journal of Operational Research, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chiou, Yu-Chiun, Lan, Lawrence W.
openaire   +1 more source

An Efficient Clustering Algorithm

IEEE Transactions on Systems, Man, and Cybernetics, 1976
A new algorithm is presented (called matching algorithm), in order to reorganize data data and identify clusters. Thus the algorithm requires only three integer additions in each step, instead of comparing the entire row to evaluate the matchings with the neighboring rows.
Bhat, M. V., Haupt, A.
openaire   +1 more source