1,579 Hits in 7.0 sec

Online decoding of Markov models under latency constraints

Mukund Narasimhan, Paul Viola, Michael Shilman
2006 Proceedings of the 23rd international conference on Machine learning - ICML '06  
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models.  ...  When compared to full Viterbi, the approach suffers a 0.1 percent error degradation with a average latency of 2.6 time steps (versus the potentially infinite latency of Viterbi).  ...  The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models.  ... 
doi:10.1145/1143844.1143927 dblp:conf/icml/NarasimhanVS06 fatcat:y65xdakhv5dvja6qzvbbwffbyu

On Coding for Delay—Network Coding for Time-Division Duplexing

Daniel E. Lucani, Muriel Medard, Milica Stojanovic
2012 IEEE Transactions on Information Theory  
Finally, we study the problem of transmission of information under the large latency and time duplexing constraints in the presence of random packet arrivals.  ...  Index Terms-Bulk queueing, half duplex, large latency, network coding, online network coding, time-division duplexing.  ...  Finally, we study the problem of transmission of information under the large latency and time duplexing constraints in the presence of random packet arrivals.  ... 
doi:10.1109/tit.2011.2177562 fatcat:nmhdxljfhvadzh7dzxdsdmqwki

Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms [article]

Vikas K. Garg, Tamar Pichkhadze
2019 arXiv   pre-print
We resolve the fundamental problem of online decoding with general n^th order ergodic Markov chain models.  ...  We also establish lower bounds for online methods under latency constraints in both deterministic and randomized settings, and show that no online algorithm can perform significantly better than our algorithms  ...  Maximum entropy markov models for information extraction and segmentation. In ICML, 2000. Narasimhan, M., Viola, P., and Shilman, M. Online decod- ing of markov models under latency constraints.  ... 
arXiv:1810.07301v2 fatcat:63nhvpkrbreubdz4jjee55qp7m

NICGSlowDown: Evaluating the Efficiency Robustness of Neural Image Caption Generation Models [article]

Simin Chen, Zihe Song, Mirazul Haque, Cong Liu, Wei Yang
2022 arXiv   pre-print
Our experimental results show that NICGSlowDown can generate images with human-unnoticeable perturbations that will increase the NICG model latency up to 483.86%.  ...  Recent research observed that the efficiency of NICG models could vary for different inputs.  ...  In this paper, we investigate a natural property of NICG models. The NICG model producing output tokens is a Markov Process; hence the number of underlying decoder calls is non-deterministic.  ... 
arXiv:2203.15859v1 fatcat:rcvfbqh2tjblvlbyjba5z2nt6y

Online, Real-time Tracking and Recognition of Human Actions

Pradeep Natarajan, Ramakant Nevatia
2008 2008 IEEE Workshop on Motion and video Computing  
To this end, we introduce the Hierarchical Variable Transition Hidden Markov Model (HVT-HMM) that is a three-layered extension of the Variable Transition Hidden Markov Model (VTHMM).  ...  In order to address this we use a variable window approach to decoding with very low latency.  ...  We also thank the authors of [1, 12] for making these datasets public.  ... 
doi:10.1109/wmvc.2008.4544064 fatcat:gayfpfltq5chlmupqrvgwcz36a

Online Network Coding for Time-Division Duplexing

Daniel E. Lucani, Muriel Medard, Milica Stojanovic
2010 2010 IEEE Global Telecommunications Conference GLOBECOM 2010  
We study an online random linear network coding approach for time division duplexing (TDD) channels under Poisson arrivals.  ...  This number depends on the latency, probability of packet erasure, degrees of freedom at the receiver, the size of the coding window, and the arrival rate of the Poisson process.  ...  Bulk queue model with feedback for online network coding for TDD channels. i e sk − e si + e si . (3) Fig. 2 . 2 Fig. 2. Absorbing Markov chain to compute time between decoding events.  ... 
doi:10.1109/glocom.2010.5683892 dblp:conf/globecom/LucaniMS10 fatcat:lynglaao3zgfljvaah362jtdfu

Super-Human Performance in Online Low-latency Recognition of Conversational Speech [article]

Thai-Son Nguyen, Sebastian Stueker, Alex Waibel
2021 arXiv   pre-print
Neural hybrid models and recent attention-based encoder-decoder models have considerably improved performance as such contexts can now be learned in an integral fashion.  ...  The system uses multiple attention-based encoder-decoder networks integrated within a novel low latency incremental inference approach.  ...  Measure of Latency Latency is one of the most important factors that decide the usability of an user-based online ASR system.  ... 
arXiv:2010.03449v5 fatcat:fgx7c22qvbhkjozqjqisyilce4

Content Delivery in Fog-Aided Small-Cell Systems with Offline and Online Caching: An Information—Theoretic Analysis

Seyyed Azimi, Osvaldo Simeone, Ravi Tandon
2017 Entropy  
ABSTRACT ONLINE EDGE CACHING AND WIRELESS DELIVERY IN FOG-AIDED NETWORKS by Seyyed Mohammadreza Azimi Multimedia content is the significant fraction of transferred data over the wireless medium in the  ...  The Van Houten library has removed some of the personal information and all signatures from the approval page and biographical sketches of theses and dissertations in order to protect the identity of NJIT  ...  Lemma 4. 2 .Figure 4 . 4 244 For an M × K F-RAN with N ≥ K, the minimum long-term NDT under online caching with pipelined fronthaul-edge transmission satisfies δ pl * on (µ, r) ≥ 1 2δ * on (µ, r), Block-Markov  ... 
doi:10.3390/e19070366 fatcat:cspn5a5y5jhrfmfkm6x5uwlfim

Simultaneous neural machine translation with a reinforced attention mechanism

YoHan Lee, JongHun Shin, YoungKil Kim
2021 ETRI Journal  
However, conventional attention-based neural machine translation (NMT) models cannot produce translations with adequate latency in online scenarios because they wait until a source sentence is completed  ...  In our experiments, the proposed model has better translation quality and comparable latency compared to previous models.  ...  Simultaneous translation can be modeled as a Markov decision process, which is a basis of RL.  ... 
doi:10.4218/etrij.2020-0358 fatcat:j2tic4j3n5azrmxmqis4ss2liq

A General Deep Reinforcement Learning Framework for Grant-Free NOMA Optimization in mURLLC [article]

Yan Liu, Yansha Deng, Hui Zhou, Maged Elkashlan, Arumugam Nallanathan
2021 arXiv   pre-print
The goal of our learning framework is to maximize the long-term average number of successfully served users (UEs) under the latency constraint.  ...  Our results show that the number of successfully served UEs under the same latency constraint in our proposed learning framework is up to ten times for the K-repetition scheme, and two times for the Proactive  ...  successfully served UEs under the latency constraint T cons .  ... 
arXiv:2101.00515v2 fatcat:q6kdd7becvfa3m3nqhpowwtpwi

Scenario-aware dataflow: Modeling, analysis and implementation of dynamic applications

Sander Stuijk, Marc Geilen, Bart Theelen, Twan Basten
2011 2011 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation  
Embedded multimedia and wireless applications require a model-based design approach in order to satisfy stringent quality and cost constraints.  ...  The Model-of-Computation (MoC) should appropriately capture system dynamics, support analysis and synthesis, and allow low-overhead model-driven implementations.  ...  Existing analyses of VRDF and VPDF are limited to computing (conservative) buffer sizes under a throughput constraint.  ... 
doi:10.1109/samos.2011.6045491 dblp:conf/samos/StuijkGTB11 fatcat:utkt755eybbjfeic2s5xc5xhmq

Surgically Implanted Electrodes Enable Real-Time Finger and Grasp Pattern Recognition for Prosthetic Hands [article]

Alex K Vaskov, Philip P Vu, Naia North, Alicia J Davis, Theodore A Kung, Deanna H Gates, Paul S Cederna, Cynthia A Chestek
2020 biorxiv/medrxiv  
Both participants were able to transition between 10 pseudo-randomly cued individual finger and wrist postures in the virtual environment with an average online accuracy of 86.5% and latency of 255 ms.  ...  When the set was reduced to five grasp postures, average metrics improved to 97.9% online accuracy and 135 ms latency.  ...  (B-C) Online accuracy and decoding latency for P1 measured as in Fig. 1 (n = 26 trials).  ... 
doi:10.1101/2020.10.28.20217273 pmid:33173910 pmcid:PMC7654906 fatcat:zlfkmrb3x5fqdngdca34wkgr6y

Random access with adaptive packet aggregation in LTE/LTE-A

Kaijie Zhou, Navid Nikaein
2016 EURASIP Journal on Wireless Communications and Networking  
We use semi-Markov model to derive the packet loss rate and channel access latency as functions of packet aggregation number.  ...  We also apply for the idea of packet aggregation for power saving, where a device aggregates as many packets as possible until the latency constraint is reached.  ...  Note that in this case, the objective is to maximize the number of aggregated packets under the delay constraint, which is different from the previous case where one of the constraints is to limit the  ... 
doi:10.1186/s13638-016-0531-6 pmid:26900389 pmcid:PMC4750459 fatcat:cdxvfguvx5cj5gta2rjom5va5y

Low latency random access with TTI bundling in LTE/LTE-A

Kaijie Zhou, Navid Nikaein
2015 2015 IEEE International Conference on Communications (ICC)  
With this model, we formulate the access latency as a function of the number of TTI bundles and select the optimal value which minimizes the channel access latency.  ...  The proposed Semi-Markov model is validated against simulation and the performance of the TTI bundling method is also evaluated.  ...  ACKNOWLEDGEMENT The research leading to these results has received funding from the European Research Council under the European Community Seventh Framework Programme (FP7/2014-2017) grant agreement 612050  ... 
doi:10.1109/icc.2015.7248661 dblp:conf/icc/ZhouN15 fatcat:ah6ptxw54jfmtcffr4cqo3lgyi

Non-orthogonal HARQ for URLLC Design and Analysis [article]

Faisal Nadeem, Mahyar Shirvanimoghaddam, Yonghui Li, Branka Vucetic
2021 arXiv   pre-print
The fifth-generation (5G) of mobile standards is expected to provide ultra-reliability and low-latency communications (URLLC) for various applications and services, such as online gaming, wireless industrial  ...  Most communication strategies rely on hybrid automatic repeat request (HARQ) to improve reliability at the expense of increased packet latency due to the retransmission of failing packets.  ...  FBL assumption. • We propose an optimization framework to maximize throughput under the target latency constraint.  ... 
arXiv:2106.16144v1 fatcat:ixu6f5jqaravni4eign5rctqge
« Previous Showing results 1 — 15 out of 1,579 results