Results 11 to 20 of about 11,335,731 (201)
Classification of Spontaneous Device Association from a Usability Perspective [PDF]
As computing devices become ubiquitous, devices are expected to encounter and associate with one another spontaneously to form ad hoc networks for sharing resources.
Chong, Ming Ki, Gellersen, Hans
core +4 more sources
Analysis of Binary Number Association Scheme Partially Balanced Designs [PDF]
46 pages, 1 article*Analysis of Binary Number Association Scheme Partially Balanced Designs* (Paik, U. B.; Federer, W.
Paik, U. B. +4 more
core +5 more sources
Reconstructing a generalized quadrangle from the Penttila–Williford 4-class association scheme [PDF]
Penttila and Williford constructed a 4-class association scheme from a generalized quadrangle with a doubly subtended subquadrangle. We show that an association scheme with appropriate parameters and satisfying some assumption about maximal cliques must ...
Monzillo G. +3 more
core +3 more sources
COSMOS-7: Video-oriented MPEG-7 scheme for modelling and filtering of semantic content [PDF]
MPEG-7 prescribes a format for semantic content models for multimedia to ensure interoperability across a multitude of platforms and application domains.
Agius, HW, Angelides, MC
core +1 more source
WLAN Mesh security association scheme in trusted computing environment [PDF]
To solve the existing problems caused by that the third version of WLAN authentication infrastructure (WAI) protocol was used to establish WLAN Mesh security association, a WLAN Mesh security association scheme based on an improved WAI protocol was ...
Liao-jun PANG +3 more
core +1 more source
Uniform Mixing and Association Schemes
We consider continuous-time quantum walks on distance-regular graphs. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit uniform mixing.First we apply a result due to Chan to show that the only strongly regular graphs that admit instantaneous uniform ...
Chris D. Godsil +2 more
openaire +3 more sources
On Quasi-thin Association Schemes
An association scheme is called quasi-thin if each of its basic relations has valency 1 or 2. In this paper three sufficient conditions for a quasi-thin scheme \((X,R)\) to have an automorphism group acting transitively on \(X\) are obtained: (i) \(O^\theta(R)\cap O_\theta(R)=\{1\}\) (Lemma 4.1), (ii) \(n_{O^\theta(R)}=2\) (Theorem 4.4), and (iii) \(R\)
Mitsugu Hirasaka, Mikhail E. Muzychuk
openaire +2 more sources
A Four-Class Association Scheme
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gary L. Ebert +3 more
openaire +3 more sources
On the Connectivity of Graphs in Association Schemes
Let $(X,\mathcal{R})$ be a commutative association scheme and let $\Gamma=(X,R\cup R^\top)$ be a connected undirected graph where $R\in \mathcal{R}$. Godsil (resp., Brouwer) conjectured that the edge connectivity (resp., vertex connectivity) of $\Gamma$ is equal to its valency.
Brian G. Kodalen, William J. Martin
openaire +3 more sources
CONTINUOUS ASSOCIATION SCHEMES AND HYPERGROUPS [PDF]
Classical finite association schemes lead to finite-dimensional algebras which are generated by finitely many stochastic matrices. Moreover, there exist associated finite hypergroups. The notion of classical discrete association schemes can be easily extended to the possibly infinite case. Moreover, this notion can be relaxed slightly by using suitably
openaire +3 more sources

