Results 281 to 290 of about 9,538,132 (298)
Some of the next articles are maybe not open access.
From Local Pair-Crossing Number to Local Crossing Number.
We prove that if a graph can be drawn in the plane such that each edge crosses at most k other edges, then it can be redrawn so that each edge participates in at most k³+O(k²) crossings. This improves the previous exponential bound that follows from a result of Schaefer and Štefankovič and answers a question of Ackerman and Schaefer.Fox, Jacob, Pach, János, Suk, Andrew
openaire +2 more sources
Effects of above-crossing tunnelling on the existing shield tunnels
Tunnelling and Underground Space Technology, 2016Rongzhu Liang, Yi Hong, Tang-Dai Xia
exaly
Scaling Theorems for Zero Crossings
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1986Tomaso Poggio, Alan Yuille
exaly
Fatal accidents at railway level crossings in Great Britain 1946–2009
Accident Analysis and Prevention, 2011Andrew W. Evans
exaly
Pedestrians’ road crossing decisions and body parts’ movements
Transportation Research Part F: Traffic Psychology and Behaviour, 2018Semyon Kalantarov +2 more
exaly
Estimating preferences for different types of pedestrian crossing facilities
Transportation Research Part F: Traffic Psychology and Behaviour, 2018Paulo Rui Anciães
exaly
An investigation of road crossing in a virtual environment
Accident Analysis and Prevention, 2003Michael J. Richardson, Lucy Johnston
exaly

