Results 261 to 270 of about 173,470 (308)
Impact of bifenthrin and clothianidin on blow fly (Diptera: Calliphoridae) oviposition patterns under laboratory and field conditions. [PDF]
J Forensic SciRivera-Miranda TS, Hans KR.
europepmc +1 more source
Baited traps as flawed proxies for carcass colonization. [PDF]
Sci RepLutz L, Amendt J, Moreau G.
europepmc +1 more source
Pollination of Enclosed Avocado Trees by Blow Flies (Diptera: Calliphoridae) and a Hover Fly (Diptera: Syrphidae). [PDF]
InsectsCook DF +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
Combinatorics, Probability and Computing, 1999
Extremal graph theory has a great number of conjectures concerning the embedding of large sparse graphs into dense graphs. Szemerédi's Regularity Lemma is a valuable tool in finding embeddings of small graphs. The Blow-up Lemma, proved recently by Komlós, Sárközy and Szemerédi, can be applied to obtain approximate versions of many of the embedding ...
openaire +2 more sources
Extremal graph theory has a great number of conjectures concerning the embedding of large sparse graphs into dense graphs. Szemerédi's Regularity Lemma is a valuable tool in finding embeddings of small graphs. The Blow-up Lemma, proved recently by Komlós, Sárközy and Szemerédi, can be applied to obtain approximate versions of many of the embedding ...
openaire +2 more sources