Results 1 - 10 of 261

Non-asymptotic throughput and delay distributions in multi-hop wireless networks

by Florin Ciucu, Oliver Hohlfeld, Pan Hui - In Allerton Conference on Communications, Control and Computing , 2010
"... Abstract—The class of Gupta-Kumar results give the asymp-totic throughput in multi-hop wireless networks but cannot predict the throughput behavior in networks of typical size. This paper addresses the non-asymptotic analysis of the multi-hop wireless communication problem and provides, for the firs ..."
Abstract - Cited by 8 (4 self) - Add to MetaCart
Abstract—The class of Gupta-Kumar results give the asymp-totic throughput in multi-hop wireless networks but cannot predict the throughput behavior in networks of typical size. This paper addresses the non-asymptotic analysis of the multi-hop wireless communication problem and provides

Necessary and Sufficient Conditions for Success of the Nuclear Norm Heuristic for Rank Minimization

by Benjamin Recht, Weiyu Xu, Babak Hassibi , 2008
"... Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This class of optimization problems, known as rank minimization, is NP-HARD, and for most practical problems there are no effic ..."
Abstract - Cited by 36 (2 self) - Add to MetaCart
of constraints is appropriately large. Finally, we give empirical evidence that these probabilistic bounds provide accurate predictions of the heuristic’s performance in non-asymptotic scenarios.

Exploiting Channel Memory for Wireless Scheduling with Limited Channel Probing: an Asymptotic Study

by Paolo Giaccone, Emilio Leonardi
"... Abstract—We consider a wireless downlink communication system with N parallel channels under the following two assumptions: (1) the channels states can be explicitly sensed at a limited rate λs, (2)channelsaremodeledas i.i.d., ON/OFF Markov chains with stationary distribution [πOF F, πON]. The goal ..."
Abstract - Add to MetaCart
probability. We obtain sufficient and necessary conditions to achieve maximum (in order sense) system throughput. Finally, we show the performance of our policy under a non-asymptotic scenario. I.

1Distributed Bayesian Detection with Byzantine Data

by Bhavya Kailkhura, Student Member, Yunghsiang S. Han, Swastik Brahma, Pramod K. Varshney
"... In this paper, we consider the problem of distributed Bayesian detection in the presence of Byzan-tines in the network. It is assumed that a fraction of the nodes in the network are compromised and reprogrammed by an adversary to transmit false information to the fusion center (FC) to degrade detect ..."
Abstract - Add to MetaCart
of Byzantine attackers in the network, the detection scheme becomes completely incapable of utilizing the sensor data for detection. We analyze the problem under different attacking scenarios and derive results for both asymptotic and non-asymptotic cases. It is found that asymptotics-based results do not hold

Asymptotically Free Non-Abelian Gauge Theories With Fermions and Scalars As Alternatives to QCD

by V. Soni , 1999
"... In this paper we construct non-Abelian gauge theories with fermions and scalars that nevertheless possess asymptotic freedom.The scalars are taken to be in a chiral multiplet transforming as (2, 2) under SU(2)L ⊗ SU(2)R and transforming as singlets under the colour SU(3) group. We consider two disti ..."
Abstract - Add to MetaCart
In this paper we construct non-Abelian gauge theories with fermions and scalars that nevertheless possess asymptotic freedom.The scalars are taken to be in a chiral multiplet transforming as (2, 2) under SU(2)L ⊗ SU(2)R and transforming as singlets under the colour SU(3) group. We consider two

Asymptotically Matched Spacetime Metric for Non-Precessing, Spinning Black Hole Binaries

by Louis Gallouin, Hiroyuki Nakano, Manuela Campanelli
"... We construct a closed-form, fully analytical 4-metric that approximately represents the spacetime evolution of non-precessing, spinning black hole binaries from infinite separations up to a few orbits prior to merger. We employ the technique of asymptotic matching to join a perturbed Kerr metric in ..."
Abstract - Add to MetaCart
We construct a closed-form, fully analytical 4-metric that approximately represents the spacetime evolution of non-precessing, spinning black hole binaries from infinite separations up to a few orbits prior to merger. We employ the technique of asymptotic matching to join a perturbed Kerr metric

NON ASYMPTOTIC EFFICIENCY OF A MAXIMUM LIKELIHOOD ESTIMATOR AT FINITE NUMBER OF SAMPLES (1)

by Alexandre Renaux, Eric Boyer , 2010
"... In estimation theory, the asymptotic (in the number of samples) efficiency of the Maximum Likelihood (ML) estimator is a well known result [1]. Nevertheless, in some scenarios, the number of snapshots may be small. We recently investigated the asymptotic behavior of the Stochastic ML (SML) estimator ..."
Abstract - Add to MetaCart
In estimation theory, the asymptotic (in the number of samples) efficiency of the Maximum Likelihood (ML) estimator is a well known result [1]. Nevertheless, in some scenarios, the number of snapshots may be small. We recently investigated the asymptotic behavior of the Stochastic ML (SML

Second-Order Coding Rates for Conditional Rate-Distortion

by Sy-quoc Le, Vincent Y. F. Tan, Mehul Motani , 2014
"... This paper characterizes the second-order coding rates for lossy source coding with side information available at both the encoder and the decoder. We first provide non-asymptotic bounds for this problem and then specialize the non-asymptotic bounds for three different scenarios: discrete memoryless ..."
Abstract - Add to MetaCart
This paper characterizes the second-order coding rates for lossy source coding with side information available at both the encoder and the decoder. We first provide non-asymptotic bounds for this problem and then specialize the non-asymptotic bounds for three different scenarios: discrete

Probabilistic Characterization of Nearest Neighbor Classifier

by Amit Dhurandhar, Alin Dobra
"... The k-Nearest Neighbor classification algorithm (kNN) is one of the most simple yet effective classification algorithms in use. It finds major applications in text categorization, outlier detection, handwritten character recognition, fraud detection and in other related areas. Though sound theoret ..."
Abstract - Cited by 5 (4 self) - Add to MetaCart
principled way of studying the non-asymptotic behavior of the kNN algorithm. In particular, we derive exact closed form expressions for the moments of the GE for this algorithm. The expressions are functions of the sample, and hence can be computed given any joint probability distribution defined over

Distributed MIMO Systems with Oblivious Antennas

by Osvaldo Simeone, Oren Somekh, H. Vincent Poor, Shlomo Shamai (shitz , 805
"... Abstract — A scenario in which a single source communicates with a single destination via a distributed MIMO transceiver is considered. The source operates each of the transmit antennas via finite-capacity links, and likewise the destination is connected to the receiving antennas through capacity-co ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
network as the channel model (as for regularly placed transmitters and receivers), achievable rates are investigated and compared with an upper bound. It is concluded that in certain asymptotic and non-asymptotic regimes obliviousness of transmitters and receivers does not cause any loss of optimality. I.
Results 1 - 10 of 261