Results 41 to 50 of about 305,530 (267)
CoRR, 2014 The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption is NP-hard, Candès and Recht showed that it can be exactly relaxed if the number of observed entries is sufficiently large.
Vassilis Kalofolias +3 more
openaire +2 more sources
The Thickness of the Complete Graph [PDF]
Canadian Journal of Mathematics, 1965 A graph G consists of a finite set of p points and q lines joining pairs of these points. Each line joins two distinct points and no pair of points is joined by more than one line. A subgraph of G is a graph whose points and lines are also in G. If every pair of points of a graph is joined by a line, the graph is called complete and is denoted by Kp. A
Beineke, L. W., Harary, Frank
openaire +2 more sources
The Square of Some Generalized Hamming Graphs
Mathematics, 2023 In this paper, we study the square of generalized Hamming graphs by the properties of abelian groups, and characterize some isomorphisms between the square of generalized Hamming graphs and the non-complete extended p-sum of complete graphs.
Yipeng Li, Jing Zhang, Meili Wang
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Type 1 plasminogen deficiency (PLGD‐1) is an ultra‐rare autosomal recessive disorder caused by variants in the PLG gene and affects approximately 1.6 individuals per million. The condition is characterized by decreased plasminogen levels and impaired function, resulting in fibrin‐rich lesions on mucous membranes throughout the body.
Charles Nakar +7 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Neurodevelopmental and neurocognitive difficulties are prevalent among individuals with sickle cell disease and warrant prompt identification and support. This Special Report provides an executive summary of standards and recommendations for surveillance, screening, and evaluation for development and cognition across the lifespan developed by ...
Alyssa M. Schlenz +12 more
wiley +1 more source
On multiplicity of quadrilaterals
AKCE International Journal of Graphs and Combinatorics, 2015 Let Kn,n be the complete bipartite graph with n vertices in each partition. We denote M(C4,Kn,n) to be the minimum number of monochromatic copies of quadrilaterals in any 2-edge coloring of Kn,n.
S.S. Rukmani, V. Vijayalakshmi
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Pediatric cancer remains a leading cause of morbidity and mortality worldwide, particularly in low‐and middle‐income countries. Cancer treatment may impair nutritional status, alter body composition, and exacerbate cancer‐related fatigue (CRF).
Luís Carlos Lopes‐Junior +11 more
wiley +1 more source
Graph Isomorphism Completeness for Trapezoid Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2015 4 pages, 3 Postscript ...
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT We report a retrospective single‐center analysis of pediatric patients with relapsed or refractory B‐cell precursor acute lymphoblastic leukemia focusing on relapses outside of the typical locations, bone marrow, central nervous system, or testes.
Johanna Kunz +7 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Together, leukemia and lymphoma account for 38.7% of newly diagnosed pediatric cancer cases in the United States each year. Many caregivers utilize online resources to inform medical health decisions. Understanding the readability of these materials is critical to ensuring comprehensible patient education.
Chloe Strege +6 more
wiley +1 more source