Filters








9 Hits in 10.0 sec

Weakly-Supervised Alignment of Video With Text [article]

Piotr Bojanowski , Edouard Grave, Ivan Laptev (WILLOW, LIENS), Jean Ponce
2015 arXiv   pre-print
Given vectorial features for both video and text, we propose to cast this task as a temporal assignment problem, with an implicit linear mapping between the two feature modalities.  ...  After demonstrating significant improvements over the state of the art on the related task of aligning video with symbolic labels [7], we evaluate our method on a challenging dataset of videos with associated  ...  This work was supported in part by a PhD fellowship from the EADS Foundation, the Institut Universitaire de France and ERC grants Activia, Allegro, Sierra and Vide-oWorld.  ... 
arXiv:1505.06027v2 fatcat:rk5hs6bopfegbaeuzcf4bg3dam

Weakly-Supervised Alignment of Video with Text

P. Bojanowski, R. Lajugie, E. Grave, F. Bach, I. Laptev, J. Ponce, C. Schmid
2015 2015 IEEE International Conference on Computer Vision (ICCV)  
Given vectorial features for both video and text, this can be cast as a temporal assignment problem, with an implicit linear mapping between the two feature modalities.  ...  After demonstrating significant improvements over the state of the art on the related task of aligning video with symbolic labels [7], we evaluate our method on a challenging dataset of videos with associated  ...  This work was supported in part by a PhD fellowship from the EADS Foundation, the Institut Universitaire de France and ERC grants Activia, Allegro, Sierra and Vide-oWorld.  ... 
doi:10.1109/iccv.2015.507 dblp:conf/iccv/BojanowskiLGBLP15 fatcat:hxxbvpruj5h3xe72ye6auv3k3y

Robust image transmission over energy-constrained time-varying channels using multiresolution joint source-channel coding

I. Kozintsev, K. Ramchandran
1998 IEEE Transactions on Signal Processing  
We consider the problem of still image transmission over time-varying channels with the channel state information (CSI) available at 1) receiver only and 2) both transmitter and receiver being informed  ...  about the state of the channel, and we quantify the effect of CSI availability on the performance.  ...  Robust Image Transmission Over Energy-Constrained Time-Varying Channels Using Multiresolution Joint Source-Channel Coding Igor Kozintsev, Student Member, IEEE, and Kannan Ramchandran, Member, IEEE Abstract-We  ... 
doi:10.1109/78.668553 fatcat:sre3kytmzbf3pc4unvbknh2aca

8th International Colloquium on Automata, Languages and Programming (ICALP 81)

1981 IEEE Transactions on Software Engineering  
: Theory and Practice Parameterized Approximation Algorithms Workshop (PAAW) Infinity Algorithmic Aspects of Temporal Graphs Constrained Recognition Problems  ...  "Uniformization problems for synchronizations of automatic relations on words".  ... 
doi:10.1109/tse.1981.234528 fatcat:ob65j2ybgzbgba6y6ar7bczb6a

Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

I. Katzela, M. Naghshineh
2000 IEEE Communications Surveys and Tutorials  
The authors provide a survey of a large number of published papers in the area of fixed, dynamic, and hybrid allocation schemes and compare their trade-offs in terms of complexity and performance.  ...  Abstract This article provides a detailed discussion of wireless resource and channel allocation schemes.  ...  A channel assignment example is given in Fig. 5 where b, c, d, and e are the available channels, and DR is the minimum reuse distance. For this example the parameter α is set to one.  ... 
doi:10.1109/comst.2000.5340800 fatcat:dd6gsumteba43fvd7cs5xn5woy

Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey

I. Katzela, M. Naghshineh
1996 IEEE personal communications  
The authors provide a survey of a large number of published papers in the area of fixed, dynamic, and hybrid allocation schemes and compare their trade-offs in terms of complexity and performance.  ...  Abstract This article provides a detailed discussion of wireless resource and channel allocation schemes.  ...  A channel assignment example is given in Fig. 5 where b, c, d, and e are the available channels, and DR is the minimum reuse distance. For this example the parameter α is set to one.  ... 
doi:10.1109/98.511762 fatcat:wq4hrzkpgve3bo7xm7rnjw3izi

Improving soft FEC performance for higher-order modulations via optimized bit channel mappings

Christian Häger, Alexandre Graell i Amat, Fredrik Brännström, Alex Alvarado, Erik Agrell
2014 Optics Express  
The optimization is applied to the AR4JA protograph family, and further extended to protograph-based spatially coupled LDPC codes assuming a windowed decoder.  ...  The results show performance gains of up to 0.25 dB, which translate into a possible extension of the transmission reach by roughly up to 8%, without significantly increasing the system complexity.  ...  ) = I(B i,k ; L i,k ) is independent of k and J(σ ) denotes the MI between the output of a symmetric Gaussian LLR channel and uniform input bits.  ... 
doi:10.1364/oe.22.014544 pmid:24977550 fatcat:7g7vuqgd45gktkvnpu3fjctihi

Uniform Protection for Multi-exposed Targets [chapter]

Roberto Vigo, Flemming Nielson, Hanne Riis Nielson
2014 Lecture Notes in Computer Science  
The analysis is formalised in terms of flow logic, and is implemented as an optimisation problem encoded into Satisfiability Modulo Theories, allowing us to deal with complex cost structures.  ...  Ensuring that information is protected proportionately to its value is a major challenge in the development of robust distributed systems, where code complexity and technological constraints might allow  ...  Such an optimisation problem can be tackled by computing assignments for a list π 1 , . . . , π n of SMT problems, where π i is a more constrained version of π i−1 that requires to improve on the cost  ... 
doi:10.1007/978-3-662-43613-4_12 fatcat:g2rijwywvvczpkjzijuftsdn6y

Density Evolution for Deterministic Generalized Product Codes with Higher-Order Modulation [article]

Christian Häger, Alexandre Graell i Amat, Henry D. Pfister, Fredrik Brännström
2016 arXiv   pre-print
performance under iterative bounded-distance decoding over the binary erasure channel (BEC) can be rigorously characterized in terms of a density evolution analysis.  ...  It has recently been shown that there exists a large class of deterministic GPCs (including, e.g., irregular PCs, half-product codes, staircase codes, and certain braided codes) for which the asymptotic  ...  We assume that the channel input X is constrained to a 2 M -PAM constellation X = {±(2i − 1) | i ∈ [2 M −1 ]} which is labeled with the binary reflected Gray code.  ... 
arXiv:1604.06553v2 fatcat:buazqbfd4radrb74gjszcxxv2m