Results 241 to 250 of about 7,423,432 (277)

HLA MATCHING AND CYCLOSPORIN IMMUNOSUPPRESSION: A STRONG CORRELATION

The Lancet, 1986
J, Cicciarelli, P I, Terasaki, M R, Mickey   +2 more
openaire   +4 more sources

Strong matching preclusion for folded hypercubes

Discrete Applied Mathematics
Zhicheng Lin, Ruizhi Lin
semanticscholar   +2 more sources

Centrifugation and index matching yield a strong and transparent bioinspired nacreous composite

Science, 2021
Description A match made clear The fabrication of strong and tough composites is of interest in many technologies, such as the combination of mechanical performance with transparency for robust display systems. Amini et al. combined and centrifuged glass
A. Amini, A. Khavari, F. Barthelat, A. Ehrlicher   +3 more
semanticscholar   +1 more source

Metal-Organic Framework-Derived Carbon/Carbon Nanotubes Mediate Impedance Matching for Strong Microwave Absorption at Fairly Low Temperatures.

ACS Applied Materials and Interfaces, 2021
The use of magnetic particles and carbon materials, particularly those with compatible dielectric and magnetic loss, is crucial in managing microwave pollution. However, the mismatched impedance of currently available absorbers constrains their practical
Jiayi Fang, Yuan-Fei Ma, Zhi Yong Zhang, Bin Yang, Y. Li, Y. Hu, Yanfen Yin, Xian Bin Liu, Ziping Wu   +8 more
semanticscholar   +1 more source

Strong-Field Atomic Phase Matching

Physical Review Letters, 2006
We interpret a learning-control experiment with the goal of optimizing multiphoton population transfer in atomic sodium in the strong-field limit. Despite multiple experimental constraints, a learning algorithm discovers optimal pulses that can be understood in terms of a simple dynamic picture of the atom-field interaction.
Carlos, Trallero-Herrero, J L, Cohen, Thomas, Weinacht   +2 more
openaire   +2 more sources

Student-Teacher Feature Pyramid Matching for Anomaly Detection

British Machine Vision Conference, 2021
Anomaly detection is a challenging task and usually formulated as an one-class learning problem for the unexpectedness of anomalies. This paper proposes a simple yet powerful approach to this issue, which is implemented in the student-teacher framework ...
Guodong Wang, Shumin Han, Errui Ding, Di Huang   +3 more
semanticscholar   +1 more source

DataDAM: Efficient Dataset Distillation with Attention Matching

IEEE International Conference on Computer Vision, 2023
Researchers have long tried to minimize training costs in deep learning while maintaining strong generalization across diverse datasets. Emerging research on dataset distillation aims to reduce training costs by creating a small synthetic set that ...
A. Sajedi, Samir Khaki, Ehsan Amjadian, Lucy Z. Liu, Y. Lawryshyn, K. Plataniotis   +5 more
semanticscholar   +1 more source

FoundationStereo: Zero-Shot Stereo Matching

Computer Vision and Pattern Recognition
Tremendous progress has been made in deep stereo matching to excel on benchmark datasets through per-domain fine-tuning. However, achieving strong zero-shot generalization — a hallmark of foundation models in other computer vision tasks — remains ...
Bowen Wen, Matthew Trepte, J. Aribido, Jan Kautz, O. Gallo, S. Birchfield   +5 more
semanticscholar   +1 more source

The maximum order of a strong matching in a random graph [PDF]

Australas. J Comb., 1994
The authors estimate the size of a maximum strong matching in the random graph \(G(n,p)\), where \(p\) is fixed. They show, modulo some constants, that for large \(n\), the size of a maximum strong matching is \(\log_ d n- (1/2)\log_ d\log_ d n\), where \(d= (1- p)^{-1}\). The argument is the usual combination of the first and second moment method.
A. El Maftouhi, L. Marquez Gordones
openaire   +1 more source

The strong matching number of a random graph [PDF]

Australas. J Comb., 2001
The strong matching number sm(\(G\)) of a graph \(G\) is the size of the largest induced matching in \(G\).
openaire   +1 more source