Results 91 to 100 of about 916,150 (184)
Mixed Steiner Triple Systems With Shortest Length
ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley +1 more source
When you come to the end of a perfect day, And you sit alone with your thoughtFor medium voice, with cello ...
core
Graph Homomorphism Revisited for Graph Matching [PDF]
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]. We take
Yixin Cao, Shenghua Wang
wiley +1 more source
Imagine Perfect Care Journal 2017
How does an empty room with a hospital bed and walls coated in whiteboard paint turn into a Room of the Future? Through trial and error, feedback from hundreds of healthcare workers, and an unwavering dedication to the ...
Imagine Perfect Care Resource Center Team
core
Chromatic Ramsey Numbers and Two‐Color Turán Densities
ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
Tree Independence Number III. Thetas, Prisms and Stars
ABSTRACT We prove that for every t ∈ N there exists τ = τ ( t ) ∈ N such that every (theta, prism, K 1 , t)‐free graph has tree independence number at most τ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source
Abstract Manual curation of gene–disease–phenotype relationships from the human genetics literature is a persistent bottleneck for maintaining its bioinformatics databases. Whereas large language models (LLMs) offer a promising alternative, there is currently no systematic benchmark that evaluates whether state‐of‐the‐art commercial LLMs can perform ...
Danqing Yin +6 more
wiley +1 more source
The Political U: New Evidence on the Economic Costs of Hybrid Regimes
ABSTRACT Recent research establishes a positive causal effect from democracy to income, although this evidence relies mostly on binary regime classifications. We extend the identification framework of Acemoglu et al. (2019) to a classification that distinguishes democracies, autocracies, and hybrid regimes for about 170 countries over 1960–2024.
Nauro F. Campos +2 more
wiley +1 more source
GDP and GDI Growth Accounting in the Open Economy: Multiplicative Fisher Decompositions
ABSTRACT While most national statistical agencies still use chained Laspeyres indices in their national accounts, the U.S. Bureau of Economic Analysis (BEA) and Statistics Canada have been at the forefront for the past two decades by using instead a superlative index—the Fisher index—when computing price and quantity indices for GDP and its components.
Ulrich Kohli
wiley +1 more source

