Results 211 to 220 of about 183,757 (269)
From Sensing Mechanisms to System Co-Design: Graphene-Based Sensors and Readout Circuits. [PDF]
Adv Sci (Weinh)Zhang J +5 more
europepmc +1 more source
Temporal speckle enables probabilistic weights for uncertainty-aware photonic AI
Pernice W +14 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Algebraic Discrete Methods, 1983
The authors present a number of results on comparison of the topological bandwidth of a graph to other graphical invariant, such as cutwidth, modified cutwidth, search number, and node search number. For binary trees of order n, a 0(n log n) algorithm to compute their topological bandwidth is obtained.
Fillia Makedon +2 more
openaire +2 more sources
The authors present a number of results on comparison of the topological bandwidth of a graph to other graphical invariant, such as cutwidth, modified cutwidth, search number, and node search number. For binary trees of order n, a 0(n log n) algorithm to compute their topological bandwidth is obtained.
Fillia Makedon +2 more
openaire +2 more sources
Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Sunil Chandran +2 more
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Sunil Chandran +2 more
openaire +4 more sources
Adaptive bandwidth binning for bandwidth management
Computer Networks, 2019Abstract In this paper, we present a novel bandwidth management scheme that we call adaptive bandwidth binning (ABB). ABB is presented in the context of a DOCSIS cable network, but it has obvious applicability to downstream service on any shared medium access network in which all downstream traffic is scheduled by a single headend device such as a ...
Gongbing Hong +2 more
openaire +2 more sources
Algorithmica, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edward G. Coffman Jr. +1 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edward G. Coffman Jr. +1 more
openaire +3 more sources
Instantaneous bandwidth and formant bandwidth
[1992] IEEE Sixth SP Workshop on Statistical Signal and Array Processing, 2003The concept of instantaneous bandwidth introduced by Cohen and Lee (1990) is used to explain 'formant bandwidth' as used in speech analysis. An explicit expression for the formant bandwidth in terms of the parameters of the components of the speech signal is given. The result is verified using real and simulated speech signals and a simple plausibility
L. Cohen, K. Assaleh, A. Fineberg
openaire +1 more source
Computing, 1983
The main results of this paper establish relationships between the bandwidth of a graphG — which is the minimum over all layouts ofG in a line of the maximum distance between images of adjacent vertices ofG — and the ease of playing various pebble games onG.
Arnold L. Rosenberg, Ivan Hal Sudborough
openaire +2 more sources
The main results of this paper establish relationships between the bandwidth of a graphG — which is the minimum over all layouts ofG in a line of the maximum distance between images of adjacent vertices ofG — and the ease of playing various pebble games onG.
Arnold L. Rosenberg, Ivan Hal Sudborough
openaire +2 more sources