Results 71 to 80 of about 124,454 (161)

Hop-distance relationship analysis with quasi-UDG model for node localization in wireless sensor networks

EURASIP Journal on Wireless Communications and Networking, 2011
In wireless sensor networks (WSNs), location information plays an important role in many fundamental services which includes geographic routing, target tracking, location-based coverage, topology control, and others.
Chen Ping, Foh Chuan, Gao Deyun, Niu Yanchao   +3 more
doaj  

Spanners for Geometric Intersection Graphs

, 2006
Efficient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R^k, a (1+\epsilon)-spanner is obtained using efficient partitioning of the space into hypercubes and solving bichromatic closest pair
Furer, Martin, Kasiviswanathan, Shiva Prasad   +1 more
core   +2 more sources

Colouring stability two unit disk graphs

, 2011
We prove that every stability two unit disk graph has chromatic number at most 3/2 times its clique number.
openaire   +2 more sources

Compact Routing in Unit Disk Graphs

, 2020
Let V ⊂ ℝ² be a set of n sites in the plane. The unit disk graph DG(V) of V is the graph with vertex set V where two sites v and w are adjacent if and only if their Euclidean distance is at most 1. We develop a compact routing scheme ℛ for DG(V). The routing scheme ℛ preprocesses DG(V) by assigning a label 𝓁(v) to every site v in V. After that, for any
Mulzer, Wolfgang, Willert, Max
openaire   +2 more sources

Improper colouring of unit disk graphs

, 2007
Motivated by a satellite communications problem, we consider a generalised colouring problem on unit disk graphs. A colouring is k -improper if no vertex receives the same colour as k +1 of its neighbours. The k -improper chromatic number chi_k (G) is the least number of colours needed in a k -improper colouring of a graph G.
Havet, Frédéric, Kang, Ross, Sereni, Jean-Sébastien   +2 more
openaire   +1 more source

Shortest Path Separators in Unit Disk Graphs

To appear in ESA 2024.
Harb, Elfarouk, Huang, Zhengcheng, Zheng, Da Wei   +2 more
openaire   +4 more sources

Edge computing task scheduling mechanism based on multi-dimensional feature extraction and attention fusion. [PDF]

PLoS One
Zhang S, Li JY, Yu P.
europepmc   +1 more source

Positive curvature conditions on contractible manifolds. [PDF]

Math Ann
Sweeney P.
europepmc   +1 more source

Deep Imputation for Skeleton data (DISK) for behavioral science. [PDF]

Nat Methods
Rose F, Michaluk M, Blindauer T, Ignatowska-Jankowska BM, O'Shaughnessy L, Stephens GJ, Pereira TD, Uusisaari MY, Bozek K.   +8 more
europepmc   +1 more source

Strong and Agile Wall-Climbing Robots Capable of Traversing Obstacles via Anisotropic Acoustic Adhesion. [PDF]

Research (Wash D C)
Yuan K, Peng J, Qin A, Zhu W, Liu Y, Ma J, Ma Y, Chen X, Snyder GJ.   +8 more
europepmc   +1 more source