Results 231 to 240 of about 7,423,432 (277)

Single-Band-Notched Ultra-Wideband Low-Sidelobe Planar Array Antenna for Millimeter-Wave Applications. [PDF]

Micromachines (Basel)
Shen Y, Zhang T.
europepmc   +1 more source

Reassessing Parity-Related Variation in Female Body Morphology: A Matched Analysis in a Contemporary Population. [PDF]

Am J Hum Biol
Lee J, Park J.
europepmc   +1 more source

Perioperative Ketorolac Is Associated With Lower Mortality After Surgically Treated Hip Fracture in Older Adults. [PDF]

J Am Acad Orthop Surg Glob Res Rev
Perle SJ, Bank NC, Morningstar JL, Himmelberg SM, Orders TM, Chen AT.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Strong matching preclusion for two-dimensional torus networks

International Journal of Computer Mathematics, 2015
The torus network is one of the most popular interconnection networks for massively parallel computing systems. The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings.
K. Feng, Shiying Wang
semanticscholar   +4 more sources

Fractional Strong Matching Preclusion for DHcube

Parallel Processing Letters, 2021
Let [Formula: see text] be a set edges and [Formula: see text] be a set of edges and/or vertices of a graph [Formula: see text], then [Formula: see text] (resp. [Formula: see text]) is a fractional matching preclusion set (resp.
He Zhang, Jinyu Zou, Shuangshuang Zhang, Chengfu Ye   +3 more
semanticscholar   +3 more sources

Strong Matching Preclusion of Arrangement Graphs

Journal of Interconnection Networks, 2016
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph with neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm.
E. Cheng, Omer Siddiqui
semanticscholar   +2 more sources

Strong matching preclusion of burnt pancake graphs

International Journal of Parallel, Emergent and Distributed Systems, 2016
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm.
E. Cheng, Justin Kelm, Roi Orzach, Brian Xu   +3 more
semanticscholar   +2 more sources

Strong Matching preclusion of Pancake graphs

Journal of Interconnection Networks, 2013
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm.
E. Cheng, David Lu, Brian Xu
semanticscholar   +2 more sources

Controlled Lagrangians, Symmetries and Conditions for Strong Matching

IFAC Proceedings Volumes, 2000
Abstract The method of controlled Lagrangians consists in constructing state feed back laws for underactuated Lagrangian systems such that the closed loop equations are Lagrangian. In this paper the general matching problem is solved and the matching conditions are given a geometrical formulation.
J. Hamberg
semanticscholar   +2 more sources

Sparkly: A Simple yet Surprisingly Strong TF/IDF Blocker for Entity Matching

Proceedings of the VLDB Endowment, 2023
Blocking is a major task in entity matching. Numerous blocking solutions have been developed, but as far as we can tell, blocking using the well-known tf/idf measure has received virtually no attention.
Derek Paulsen, Yash Govind, A. Doan
semanticscholar   +1 more source