Results 201 to 210 of about 415,247 (217)
Fluorescent protein tags for human tropomyosin isoform comparison
Scott W +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Admissibie wavelets on the unit disk
Complex Variables, Theory and Application: An International Journal, 1998Let .SU(1. 1) be the Mobius group, and K the maximal compact SU(1. 1). Then SU(1.1)/K can be regarded as the unit disk of complex plane In this paper, the unit disk is regarded as a homogeneous space, in the viewpoint of coherent state we give the admissible condition of admissible wavelet and the orthogonal decomposition of Lα,2(D,dμα).
Lizhong Peng, Jianxun He
openaire +2 more sources
Planar Hop Spanners for Unit Disk Graphs [PDF]
, 2010 The simplest model of a wireless network graph is the Unit Disk Graph (UDG): an edge exists in UDG if the Euclidean distance between its endpoints is ≤ 1. The problem of constructing planar spanners of Unit Disk Graphs with respect to the Euclidean distance has received considerable attention from researchers in computational geometry and ad-hoc ...
Catusse, Nicolas +2 more
openaire +7 more sources
Algorithmica, 1998
In this paper the coloring problem for unit disk (UD) graphs is considered. UD graphs are the intersection graphs of equal-sized disks in the plane. Colorings of UD graphs arise in the study of channel assignment problems in broadcast networks. Improving on a result of Clark et al.
Albert Gräf +2 more
openaire +2 more sources
In this paper the coloring problem for unit disk (UD) graphs is considered. UD graphs are the intersection graphs of equal-sized disks in the plane. Colorings of UD graphs arise in the study of channel assignment problems in broadcast networks. Improving on a result of Clark et al.
Albert Gräf +2 more
openaire +2 more sources
On the Discrete Unit Disk Cover Problem
International Journal of Computational Geometry & Applications, 2011Given a set [Formula: see text] of n points and a set [Formula: see text] of m unit disks on a 2-dimensional plane, the discrete unit disk cover (DUDC) problem is (i) to check whether each point in [Formula: see text] is covered by at least one disk in [Formula: see text] or not and (ii) if so, then find a minimum cardinality subset [Formula: see text]
Robert Fraser +3 more
openaire +3 more sources
2012
A unit disk is a disk with diameter one. Denote by disk r (o) the disk with center o and radius r. A graph G = (V, E) is called a unit disk graph if it can be embedded into the Euclidean plane such that an edge between two nodes u and v exists if and only if disk0. 5(u) ∩ disk0. 5(v)≠∅, that is, their Euclidean distance d(u, v) ≤ 1. The unit disk graph
Peng-Jun Wan, Ding-Zhu Du
openaire +2 more sources
A unit disk is a disk with diameter one. Denote by disk r (o) the disk with center o and radius r. A graph G = (V, E) is called a unit disk graph if it can be embedded into the Euclidean plane such that an edge between two nodes u and v exists if and only if disk0. 5(u) ∩ disk0. 5(v)≠∅, that is, their Euclidean distance d(u, v) ≤ 1. The unit disk graph
Peng-Jun Wan, Ding-Zhu Du
openaire +2 more sources
AIP Conference Proceedings, 2015
In this work, we focus on constructing a rational approximant to a given bivariate function on the unit disk via affine Transformational HDMR. The elements of a mutual orthogonal set of bivariate polynomials on the unit disk are used as basis functions both in the numerator and the denominator of the approximant.
openaire +2 more sources
In this work, we focus on constructing a rational approximant to a given bivariate function on the unit disk via affine Transformational HDMR. The elements of a mutual orthogonal set of bivariate polynomials on the unit disk are used as basis functions both in the numerator and the denominator of the approximant.
openaire +2 more sources