Results 221 to 230 of about 230,604 (269)
Some of the next articles are maybe not open access.
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
IEEE Multimedia, 2003
Provisioning bandwidth in an actuarially consistent manner has many far-reaching implications reminiscent of the commercial rationalization of railways in the 1870s - in that period's path to profitability. Mapping packet flow to willingness to pay, as rail cargo content was matched to the cost of carry, will better utilize bandwidth, enhancing network
S. Moskowitz, N. Dimitrova
openaire +1 more source
Provisioning bandwidth in an actuarially consistent manner has many far-reaching implications reminiscent of the commercial rationalization of railways in the 1870s - in that period's path to profitability. Mapping packet flow to willingness to pay, as rail cargo content was matched to the cost of carry, will better utilize bandwidth, enhancing network
S. Moskowitz, N. Dimitrova
openaire +1 more source
Proceedings of the 32nd annual ACM SIGUCCS conference on User services, 2004
Whitman College, like all other residential institutions of higher education, has been struggling with taming the bandwidth for the Residence Hall network. It doesn't seem to matter how much bandwidth is provided, or how much packet shaping effort is made -- it only takes a handful of students with a new P2P tool to completely saturate the network ...
Keiko Pitter +2 more
openaire +1 more source
Whitman College, like all other residential institutions of higher education, has been struggling with taming the bandwidth for the Residence Hall network. It doesn't seem to matter how much bandwidth is provided, or how much packet shaping effort is made -- it only takes a handful of students with a new P2P tool to completely saturate the network ...
Keiko Pitter +2 more
openaire +1 more source
Distributed bandwidth reservation by probing for available bandwidth
The 11th IEEE International Conference on Networks, 2003. ICON2003., 2004For many applications in Internet protocol-based networks a guaranteed quality of service is crucial. A simple and scalable way of achieving this is to use the differentiated services architecture in conjunction with admission control. In this research, we focus on the reservation of bandwidth by routers on the edge of a single network domain with ...
Sven Krasser +4 more
openaire +1 more source
Bandwidth allocation with preemption
Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95, 1995Summary: Bandwidth allocation is a fundamental problem in the design of networks where bandwidth has to be reserved for connections in advance. The problem is intensified when the overall requested bandwidth exceeds the capacity and not all requests can be served. Furthermore, acceptance/rejection decisions regarding connections have to be made online,
Amotz Bar-Noy +4 more
openaire +2 more sources
Data Compression Conference, 2003. Proceedings. DCC 2003, 2003
In 1960, Campbell derived a quantity that he defined as the coefficient rate of a random process that involves the process spectral entropy. However, no potential applications of the coefficient rate were identified. Two new derivations of Campbell's rate coefficient rate are presented. One derivation solidifies the interpretation of this quantity as a
Wenye Yang, Tao He, Jerry D. Gibson
openaire +1 more source
In 1960, Campbell derived a quantity that he defined as the coefficient rate of a random process that involves the process spectral entropy. However, no potential applications of the coefficient rate were identified. Two new derivations of Campbell's rate coefficient rate are presented. One derivation solidifies the interpretation of this quantity as a
Wenye Yang, Tao He, Jerry D. Gibson
openaire +1 more source
On bandwidth and cyclic bandwidth of graphs
Ars Comb., 1997Summary: Let \(B(G)\) and \(B_c(G)\) denote the bandwidth and cyclic bandwidth of graph \(G\), respectively. We give a sufficient condition for graphs to have equal bandwidth and cyclic bandwidth. This condition is satisfied by trees. Thus all theorems on bandwidth of graphs apply to cyclic bandwidth of graphs satisfying the sufficiency condition, and ...
Peter Che Bor Lam +2 more
openaire +1 more source
Approximating the Bandwidth of Caterpillars
Algorithmica, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uriel Feige, Kunal Talwar
openaire +1 more source
Empirical effective bandwidths
Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), 2002We analyze the accuracy of four methods for measuring effective bandwidths (EBs). We point out advantages and drawbacks of the four estimators. We find that for finite time realizations of a process the measured effective bandwidth differs considerably from its analytical counterpart.
S. Tartarelli +4 more
openaire +2 more sources
Linear Discrepancy and Bandwidth
Order, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter C. Fishburn +2 more
openaire +1 more source