Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID50th Allerton Conference 2012: Monticello, IL, USA
- 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, Allerton Park & Retreat Center, Monticello, IL, USA, October 1-5, 2012. IEEE 2012, ISBN 978-1-4673-4537-8
- Sergio Verdú:
Non-asymptotic achievability bounds in multiuser information theory. 1-8 - Bernd Bandemer, Abbas El Gamal, Young-Han Kim:
Simultaneous nonunique decoding is rate-optimal. 9-16 - Fatemeh Hamidi-Sepehr, Jean-François Chamberland
, Henry D. Pfister:
On the performance of random block codes over finite-state fading channels. 17-25 - Binnan Zhuang, Dongning Guo, Michael L. Honig:
Energy management of dense wireless heterogeneous networks over slow timescales. 26-32 - Nihat Engin Tunali, Krishna R. Narayanan, Joseph J. Boutros, Yu-Chih Huang:
Lattices over Eisenstein integers for compute-and-forward. 33-40 - Karla Kvaternik, Jaime Llorca, Daniel C. Kilper, Lacra Pavel:
A decentralized coordination strategy for networked multiagent systems. 41-47 - Laurent Lessard:
Optimal control of a fully decentralized quadratic regulator. 48-54 - Carsten W. Scherer:
Distributed control with dynamic dissipation constraints. 55-62 - Andrea Simonetto, Tamás Keviczky, Dimos V. Dimarogonas:
Distributed solution for a Maximum Variance Unfolding Problem with sensor and robotic network applications. 63-70 - Anthony Kelman, Francesco Borrelli:
Parallel nonlinear predictive control. 71-78 - Tyler H. Summers, John Lygeros:
Distributed model predictive consensus via the Alternating Direction Method of Multipliers. 79-84 - Fu Lin, Makan Fardad, Mihailo R. Jovanovic:
Identification of sparse communication graphs in consensus networks. 85-89 - Anil Aswani, Claire J. Tomlin:
Incentive design for efficient building quality of service. 90-97 - Ahmed Elmahdi, Ahmad F. Taha, Stefen Hui, Stanislaw H. Zak:
A hybrid scheduling protocol to improve quality of service in networked control systems. 98-105 - Ismail Bayezit, Tjalling Veldhuizen, Baris Fidan, Jan Paul Huissoon, Henk Lupker:
Design of string stable adaptive cruise controllers for highway and urban missions. 106-113 - Vishwesh V. Kulkarni, Theerachai Chanyaswad, Marc D. Riedel, Jongmin Kim:
Robust tunable in vitro transcriptional oscillator networks. 114-119 - Stacy Patterson, Mike P. Wittie, Kevin C. Almeroth, Bassam Bamieh:
Network optimization with dynamic demands and link prices. 120-127 - Martin Kasparick, Gerhard Wunder:
Wireless network design under service constraints. 128-135 - Babak Fotouhi, Michael G. Rabbat:
Migration in a small world: A network approach to modeling immigration processes. 136-143 - David Conti, Nigel Boston:
The Factorization Theorem and new algebraic insights into the theory of linear trellises. 144-151 - Hamed Mirghasemi, Aslan Tchamkerten:
On the capacity of the one-bit deletion and duplication channel. 152-159 - Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Weak flip codes and applications to optimal code design on the binary erasure channel. 160-167 - Christian Senger:
The periodicity transform in algebraic decoding of Reed-Solomon codes. 168-175 - Santhosh Kumar, Andrew J. Young, Nicolas Macris, Henry D. Pfister:
A proof of threshold saturation for spatially-coupled LDPC codes on BMS channels. 176-184 - Qing Li:
Compressed Rank Modulation. 185-192 - Jianwei Xie, Sennur Ulukus:
Secure degrees of freedom of the Gaussian wiretap channel with helpers. 193-200 - Tiance Wang, John Sturm, Paul W. Cuff, Sanjeev R. Kulkarni:
Condorcet voting methods avoid the paradoxes of voting theory. 201-203 - Xiang He, Aylin Yener:
The interference wiretap channel with an arbitrarily varying eavesdropper: Aligning interference with artificial noise. 204-211 - Yee Wei Law, Tansu Alpcan, Marimuthu Palaniswami:
Security games for voltage control in smart grid. 212-219 - SingRu Celine Hoe, Murat Kantarcioglu, Alain Bensoussan:
Studying dynamic equilibrium of cloud computing adoption with application of Mean Field Games. 220-224 - Giacomo Bacci, Luca Sanguinetti, Marco Luise, H. Vincent Poor:
Improving the energy efficiency of contention-based synchronization of (O)FDMA networks. 225-232 - Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik:
Exploiting the non-commutativity of nonlinear operators for information-theoretic security in disadvantaged wireless environments. 233-240 - Olav Tirkkonen, Riku Jäntti:
On α-proportional fair packet scheduling in OFDMA downlink. 241-245 - Joseph G. McMichael, Kenneth E. Kolodziej:
Optimal tuning of analog self-interference cancellers for full-duplex wireless communication. 246-251 - Ali Tajer, H. Vincent Poor:
Cost of proportional fairness in multiuser networks. 252-257 - Tong Zhen, Martin Haenggi:
Transport density vs. channel access time in wireless networks: Power control and efficient mac design. 258-263 - Phisan Kaewprapha, Tiffany Jing Li, Nattakan Puttarak:
Cognitive radio sensing through belief propagation and distributed consensus. 264-271 - Vincent Y. F. Tan:
Transmission of correlated sources over a MAC: A Gaussian approximation-based analysis. 272-277 - En-Hui Yang, Jin Meng:
Channel capacity in the non-asymptotic regime: Taylor-type expansion and computable benchmarks. 278-285 - Ebrahim MolavianJazi, J. Nicholas Laneman:
A random coding approach to Gaussian multiple access channels with finite blocklength. 286-293 - Yury Polyanskiy:
ℓp-norms of codewords from capacity- and dispersion-achieveing Gaussian codes. 294-301 - Adrià Tauste Campo, Gonzalo Vazquez-Vilar, Albert Guillen i Fabregas, Alfonso Martinez:
Converse bounds for finite-length joint source-channel coding. 302-307 - Adam N. Jacobvitz, A. Robert Calderbank, Daniel J. Sorin:
Writing cosets of a convolutional code to increase the Lifetime of Flash memory. 308-318 - G. David Forney Jr.:
Codes on graphs: Past, present and future. 319-325 - Gauri Joshi, Yanpei Liu, Emina Soljanin:
Coding for fast content download. 326-333 - Swarnendu Kar, Pramod K. Varshney:
Controlled collaboration for linear coherent estimation in wireless sensor networks. 334-341 - Yi Ouyang, Demosthenis Teneketzis:
On the optimality of a myopic policy in multi-state channel probing. 342-349 - Vikram Krishnamurthy:
Optimal sampling control with quickest change detection. 350-357 - William Moran, Stephen D. Howard, Douglas Cochran, Sofia Suvorova:
Sensor management via riemannian geometry. 358-362 - David A. Castañón:
Controlled sensing for classification using image-based sensor networks. 363-370 - Yu Zhang, Mihaela van der Schaar:
Collective ratings for online labor markets. 371-378 - Anand D. Sarwate:
Merging opinions by social sampling of posteriors. 379-385 - Michael P. Wellman, Bryce Wiedenbeck:
An empirical game-theoretic analysis of credit network formation. 386-393 - Felix Ming, Fai Wong, Peter Marbach:
Similarity-based network formation. 394-399 - K. Lakshmanan, Shalabh Bhatnagar:
A novel Q-learning algorithm with function approximation for constrained Markov decision processes. 400-405 - Jing Xie, Peter I. Frazier, Sethuraman Sankaran, Alison L. Marsden, Saleh Elmohamed:
Optimization of computationally expensive simulations with Gaussian processes and parameter uncertainty: Application to cardiovascular surgery. 406-413 - Peter J. Haas, Nicole C. Barberis, Piyaphol Phoungphol, Ignacio G. Terrizzano, Wang-Chiew Tan, Patricia G. Selinger, Paul P. Maglio:
Splash: Simulation optimization in complex systems of systems. 414-425 - Ka-Hung Hui, Vijay G. Subramanian, Dongning Guo, Randall Berry:
Diffusion of innovation in two-sided markets. 426-433 - Ceyhun Eksin, Pooya Molavi, Alejandro Ribeiro, Ali Jadbabaie:
Learning in linear games over networks. 434-440 - Vijay Kamble, Jean C. Walrand:
The price of insecurity: Public information transmission in zero-sum games. 441-448 - Ari Arapostathis:
Time asymptotic behavior of the HJB equation associated with a class of mean-field games. 449-451 - Yuanzhang Xiao, Mihaela van der Schaar:
Repeated resource sharing among selfish players with imperfect binary feedback. 452-459 - Vivek S. Borkar, Rahul M. Makhijani:
Who is the fairest of them all? 460-465 - Serdar Yüksel:
Jointly Optimal LQG quantization and control policies for multi-dimensional linear Gaussian sources. 466-473 - Jake V. Bouvrie, Mauro Maggioni:
Efficient solution of Markov decision problems with multiscale representations. 474-481 - Sergey G. Bobkov, Mokshay M. Madiman:
An equipartition property for high-dimensional log-concave distributions. 482-488 - Narayana P. Santhanam, Venkat Anantharam:
Universal algorithms: Building a case for pointwise convergence. 489-493 - Waheed U. Bajwa, Dustin G. Mixon:
Group model selection using marginal correlations: The good, the bad and the Ugly. 494-501 - Nebojsa Milosavljevic, Sameer Pawar, Michael Gastpar, Kannan Ramchandran:
Efficient algorithms for the data exchange problem under fairness constraints. 502-508 - Weifei Zeng, Viveck R. Cadambe, Muriel Médard:
An Edge Reduction Lemma for linear network coding and an application to two-unicast networks. 509-516 - Ulric J. Ferner, Muriel Médard, Emina Soljanin:
Toward sustainable networking: Storage area networks with network coding. 517-524 - Christopher S. Chang, Tracey Ho, Michelle Effros:
Peer-to-peer anonymous networking using coding. 525-532 - Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto:
New parameters of linear codes expressing security performance of universal secure network coding. 533-540 - Thomas Stahlbuhk, Brooke Shrader:
Reliability guarantees for lossy network coding subgraph construction. 541-548 - François Leduc-Primeau, Warren J. Gross:
Faulty Gallager-B decoding with optimal message repetition. 549-556 - Felix Poloczek, Florin Ciucu:
Coding of Brownian motion by quantization of exit times. 557-564 - Matthieu R. Bloch, Laura Luzzi, Jörg Kliewer:
Strong coordination with polar codes. 565-571 - Zachary Dutton, Saikat Guha, Mark M. Wilde:
Performance of polar codes for quantum and private classical communication. 572-579 - Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Polar codes for sources with finite reconstruction alphabets. 580-586 - Manolis C. Tsakiris, Danielle C. Tarraf:
On decompositions of finite horizon DP Problems with linear dynamics. 587-592 - Konstantinos I. Tsianos, Michael G. Rabbat:
Distributed strongly convex optimization. 593-600 - Annie I. Chen, Asuman E. Ozdaglar:
A fast distributed proximal-gradient method. 601-608 - Ajit Gopalakrishnan, Arvind U. Raghunathan, Daniel Nikovski, Lorenz T. Biegler:
Global optimization of Optimal Power Flow using a branch & bound algorithm. 609-616 - Avhishek Chatterjee, Lei Ying, Sriram Vishwanath:
Revenue and reputation: A stochastic control approach to profit maximization. 617-623 - Shlomi Vituri, Meir Feder:
Dispersion of infinite constellations in fast fading channels. 624-631 - Yongseok Yoo, Onur Ozan Koyluoglu, Sriram Vishwanath, Ila Fiete:
Dynamic shift-map coding with side information at the decoder. 632-639 - Duo Xu, Jin Meng, En-Hui Yang:
Non-asymptotic fixed-rate Slepian-Wolf coding theorem. 640-647 - Chiranjib Choudhuri, Urbashi Mitra:
On non-causal side information at the encoder. 648-655 - Mostafa Khoshnevisan, J. Nicholas Laneman:
Intermittent communication and partial divergence. 656-662 - Yücel Altug, Aaron B. Wagner:
A refinement of the random coding bound. 663-670 - Karthik Ganesan, Pulkit Grover, Andrea Goldsmith:
How far are LDPC codes from fundamental limits on total power consumption? 671-678 - Christoph Roth, Christian Benkeser, Christoph Studer, Georgios Karakonstantis, Andreas Burg:
Data mapping for unreliable memories. 679-685 - Christoph Reller, Murthy V. Devarakonda, Hans-Andrea Loeliger:
Glue factors, likelihood computation, and filtering in state space models. 686-689 - Dinesh Ramasamy, Sriram Venkateswaran, Upamanyu Madhow:
Compressive tracking with 1000-element arrays: A framework for multi-Gbps mm wave cellular downlinks. 690-697 - Reinhard Heckel, Helmut Bölcskei:
Joint sparsity with different measurement matrices. 698-702 - Erman Ayday, Jun Zou, Arash Einolghozati, Faramarz Fekri:
A recommender system based on Belief Propagation over Pairwise Markov Random Fields. 703-707 - Mohammad Hassan Lotfi, Saswati Sarkar:
Uncertain price competition in a duopoly: Impact of heterogeneous availability of the commodity under sale. 708-715 - Srdjan Z. Budisin, Predrag Spasojevic:
Filter bank representation of complementary sequence pairs. 716-723 - Dragana Bajovic, João Manuel Freitas Xavier, Bruno Sinopoli:
Products of stochastic matrices: Large deviation rate for Markov chain temporal dependencies. 724-729 - Yoojin Choi, Petar Momcilovic:
On a critical regime for linear finite-buffer networks. 730-737 - Harsha Honnappa, Rahul Jain, Amy R. Ward:
The A(i)/GI/l Queue: A new model of transitory queueing. 738-745 - Sharayu Moharir, Sujay Sanghavi:
Online load balancing and correlated randomness. 746-753 - Dongyue Xue, Eylem Ekici:
On reducing delay and temporal starvation of queue-length-based CSMA algorithms. 754-761 - Gugan Thoppe:
Generalized network tomography. 762-769 - Alexander Shpiner, Erez Kantor, Pu Li, Israel Cidon, Isaac Keslassy:
On the capacity of bufferless Networks-on-Chip. 770-777 - Gongguo Tang, Badri Narayan Bhaskar, Parikshit Shah, Benjamin Recht:
Compressive sensing off the grid. 778-785 - Mayank Bakshi, Sidharth Jaggi, Sheng Cai, Minghua Chen:
SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits. 786-793 - Kishore Jaganathan, Samet Oymak, Babak Hassibi:
On robust phase retrieval for sparse signals. 794-799 - Jean Barbier, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Compressed sensing of approximately-sparse signals: Phase transitions and optimal reconstruction. 800-807 - Maria Chiara Angelini, Federico Ricci-Tersenghi, Yoshiyuki Kabashima:
Compressed sensing with sparse, structured matrices. 808-814 - Philip Schniter, Sundeep Rangan:
Compressive phase retrieval via generalized approximate message passing. 815-822 - Rami Atar, Avishai Mandelbaum, Asaf Zviran:
Control of Fork-Join Networks in heavy traffic. 823-830 - Vinay Joseph, Gustavo de Veciana, Ari Arapostathis:
Resource allocation: Realizing mean-variability-fairness tradeoffs. 831-838 - Nicolò Michelusi, Kostas Stamatiou, Michele Zorzi:
Performance analysis of energy harvesting sensors with time-correlated energy supply. 839-846 - Jianhang Gao, Qing Zhao, Ananthram Swami:
The thinnest path problem for secure communications: A directed hypergraph approach. 847-852 - Dileep M. Kalathil, Naumaan Nayyar, Rahul Jain:
Multi-player multi-armed bandits: Decentralized learning with IID rewards. 853-860 - Raman Arora, Andrew Cotter, Karen Livescu, Nathan Srebro:
Stochastic optimization for PCA and PLS. 861-868 - Nigel Boston:
On the Belgian chocolate problem and output feedback stabilization: Efficacy of algebraic methods. 869-870 - Jun Geng, Lifeng Lai, Erhan Bayraktar:
Quickest change point detection with sampling right constraints. 874-881 - Babak Ahsant, R. Viswanathan, Sakthivel Jeyaratnam, Sudharman K. Jayaweera:
New results on large sample performance of counting rules. 882-885 - Francesco Fusco, Amadou Ba:
Fault diagnosis of water distribution networks based on state-estimation and hypothesis testing. 886-892