Results 251 to 260 of about 59,272 (301)
Periocular Reconstruction in Facial Trauma: Surgical Approaches and Multidisciplinary Perspectives. [PDF]
CureusFernández Varela Gómez F +10 more
europepmc +1 more source
A Synopsis of Two Decades of Arthropod Related Research at the Forensic Anthropology Research Facility (FARF), Texas State University (TXST), San Marcos, Texas, USA. [PDF]
InsectsNkhoma TB +5 more
europepmc +1 more source
Conducting transformative research protocols in sports science. [PDF]
Front Sports Act LivingSanti R +3 more
europepmc +1 more source
Histone 3 lysine 56 acetylation (H3K56ac) regulates extrachromosomal DNA (ecDNA) hub maintenance. [PDF]
NeoplasiaLiao LZ +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACM Transactions on Sensor Networks, 2016
In wireless sensor networks (WSNs), a space filling curve (SFC) refers to a path passing through all nodes in the network, with each node visited at least once. By enforcing a linear order of the sensor nodes through an SFC, many applications in WSNs concerning serial operations on both sensor nodes and sensor data can be performed, with examples ...
Chen Wang +4 more
openaire +2 more sources
In wireless sensor networks (WSNs), a space filling curve (SFC) refers to a path passing through all nodes in the network, with each node visited at least once. By enforcing a linear order of the sensor nodes through an SFC, many applications in WSNs concerning serial operations on both sensor nodes and sensor data can be performed, with examples ...
Chen Wang +4 more
openaire +2 more sources
Combinatorica, 1997
Some earlier proofs are strengthened and refined to give the following theorem (called the blow-up lemma). Given a graph \(R\), natural number \(\Delta\), and some \(\delta>0\), there exists some \(\varepsilon>0\) that the following holds. Blow up every vertex of \(R\) to some larger set and build two graphs, \(G\) and \(G'\), on the enlarged set as ...
Komlós, J. +2 more
openaire +1 more source
Some earlier proofs are strengthened and refined to give the following theorem (called the blow-up lemma). Given a graph \(R\), natural number \(\Delta\), and some \(\delta>0\), there exists some \(\varepsilon>0\) that the following holds. Blow up every vertex of \(R\) to some larger set and build two graphs, \(G\) and \(G'\), on the enlarged set as ...
Komlós, J. +2 more
openaire +1 more source
Blowing Up Symplectic Orbifolds
Annals of Global Analysis and Geometry, 2001The author studies different blow-up constructions on symplectic orbifolds by using different circle actions. Some of these constructions are used to describe the behavior of reduced spaces of Hamiltonian circle actions on a symplectic orbifold, when passing a critical level of its Hamiltonian function. Using these descriptions, the author generalizes,
openaire +2 more sources