default search action
54th Allerton Conference 2016: Monticello, IL, USA
- 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016, Monticello, IL, USA, September 27-30, 2016. IEEE 2016, ISBN 978-1-5090-4550-1
- Minh N. Do
, Naira Hovakimyan:
Foreword. 1 - Emmanuel Abbe:
Graph compression: The effect of clusters. 1-8 - Francesco Caltagirone, Marc Lelarge, Léo Miolane:
Recovering asymmetric communities in the stochastic block model. 9-16 - Pablo Martínez-Nuevo
Amplitude sampling. 17-22 - Vaishakhi Mayya, Boyla Mainsah, Galen Reeves:
Modeling the P300-based brain-computer interface as a channel with memory. 23-30 - Cédric Richier, Rachid El Azouzi, Tania Jiménez, Eitan Altman, Georges Linarès:
Predicting popularity dynamics of online contents using data filtering methods. 31-38 - I-Hsiang Wang, Shao-Lun Huang, Kuan-Yun Lee:
Extracting sparse data via histogram queries. 39-45 - Jingge Zhu
Typical sumsets of linear codes. 46-53 - Kai Zhang, Chao Tian:
Symmetry reduction of information inequalities. 54-61 - Meryem Benammar, Abdellatif Zaidi:
Rate distortion regions of Heegard-Berger problems with successive refinement and scalable coding. 62-69 - Minh Thanh Vu
Successive refinement with cribbing and side information. 70-77 - Mani Bastani Parizi, Emre Telatar:
On channel resolvability in presence of Feedback. 78-85 - Rashad Eletreby, Osman Yagan:
Node isolation of secure wireless sensor networks under a heterogeneous channel model. 86-92 - Khac-Hoang Ngo
Cache-aided content delivery in MIMO channels. 93-100 - Sahand Golnarian, J. Nicholas Laneman, Michael D. Lemmon:
On the outage performance of an IEEE 802.11 broadcast scheme in vehicular Ad Hoc Networks. 101-106 - Salah Eddine Hajri, Mohamad Assaad, Giuseppe Caire:
Scheduling in Massive MIMO: User clustering and pilot assignment. 107-114 - Vikram Krishnamurthy, Anup Aprem, Sujay Bhatt:
Multiple stopping time POMDPs: Structural results. 115-120 - Javad Heydari, Ali Tajer:
Quickest search for local structures in line networks. 121-127 - Yao Xie, Lee M. Seversky:
Sequential low-rank change detection. 128-133 - Yi Ouyang, Rahul Jain
On the existence of near-optimal fixed time control of traffic intersection signals. 134-141 - Chung Chan
Duality between feature selection and data clustering. 142-147 - Xiugang Wu, Leighton Pate Barnes, Ayfer Özgür
Cover's open problem: "The Capacity of the Relay Channel". 148-155 - Arman Rahimzamani, Sreeram Kannan:
Network inference using directed information: The deterministic limit. 156-163 - Songze Li, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Coded Distributed Computing: Straggling Servers and Multistage Dataflows. 164-171 - Jianan Zhang, Edmund Yeh, Eytan H. Modiano:
Robustness of interdependent random geometric networks. 172-179 - Jun Zhao
Initial spreaders in online social networks. 180-186 - Mahmoud Khaled, Matthias Rungger, Majid Zamani
Symbolic models of networked control systems: A feedback refinement relation approach. 187-193 - Steven Weber:
The stability transition graph under cascade dynamics for social network subscription services. 194-201 - Ashish Bora, Vivek S. Borkar, Dinesh Garg, Rajesh Sundaresan:
Edge conductance estimation using MCMC. 202-208 - Guannan Qu, Na Li:
Accelerated Distributed Nesterov Gradient Descent for smooth and strongly convex functions. 209-216 - Amir Ajorlou, Ali Jadbabaie:
Equilibrium analysis for a leader-follower game with noisy observations: A pace forward in Witsenhausen's counterexample conjecture. 217-218 - John W. Simpson-Porco:
Input/output analysis of primal-dual gradient algorithms. 219-224 - Adrian Hauswirth
Projected gradient descent on Riemannian manifolds with applications to online power system optimization. 225-232 - Maël Le Treust, Tristan Tomala:
Information design for strategic coordination of autonomous devices with non-aligned utilities. 233-242 - Yuanzhang Xiao, Chaithanya Bandi
Robust supply function bidding in electricity markets with renewables. 243-247 - Georges El Rahi, Anibal Sanjab, Walid Saad, Narayan B. Mandayam, H. Vincent Poor:
Prospect theory for enhanced smart grid resilience using distributed energy storage. 248-255 - Abhinav Sinha, Achilleas Anastasopoulos:
Structured perfect Bayesian equilibrium in infinite horizon dynamic games with asymmetric information. 256-263 - Deepanshu Vasal, Achilleas Anastasopoulos:
Decentralized Bayesian learning in dynamic games. 264-273 - Bhaskar Ramasubramanian, Rance Cleaveland, Steven I. Marcus:
A framework for decentralized opacity in linear systems. 274-280 - Vaneet Aggarwal
A note on information-theoretic bounds on matrix completion under union of subspaces model. 281-283 - Pengyu Xiao, Laura Balzano
Online sparse and orthogonal subspace estimation from partial information. 284-291 - Davood Mardani, George K. Atia, Ayman F. Abouraddy:
Sparse reconstruction under sensing constraints: A controlled approach. 292-298 - Yi Zhou, Huishuai Zhang, Yingbin Liang:
On Compressive orthonormal Sensing. 299-305 - Yauhen Yakimenka, Eirik Rosnes:
On failing sets of the interval-passing algorithm for compressed sensing. 306-311 - Michael Mitzenmacher:
Analyzing distributed Join-Idle-Queue: A fluid limit approach. 312-318 - Alexander L. Stolyar, Yuan Zhong:
A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing model. 319-326 - Kush R. Varshney:
Interpretable machine learning via convex cardinal shape composition. 327-330 - Yi Zhou, Huishuai Zhang, Yingbin Liang:
Geometrical properties and accelerated gradient solvers of non-convex phase retrieval. 331-335 - Mohammadhossein Chaghazardi, Shuchin Aeron:
On unsupervised clustering under the union of tensor subspaces. 336-340 - Eliya Nachmani, Yair Be'ery
Learning to decode linear codes using deep learning. 341-346 - Naveen Goela:
The structure of polarized channels via explicit parameters. 347-354 - Thomas H. Cormen, Jessica C. Fan:
Dense Gray codes, or easy ways to generate cyclic and non-cyclic Gray codes for the first n whole numbers. 355-362 - Carol Wang:
On the capacity of the binary adversarial wiretap channel. 363-369 - Badri N. Vellambi
Sufficient conditions for the equality of exact and Wyner common information. 370-377 - Ali Moharrer, Shuangqing Wei, George T. Amariucai, Jing Deng:
Synthesis of Gaussian trees with correlation sign ambiguity: An information theoretic approach. 378-384 - Giel J. Op 't Veld
Total correlation of Gaussian vector sources on the Gray-Wyner network. 385-392 - Solmaz Torabi, John MacLaren Walsh:
Distributed lossy interactive function computation. 393-400 - Venkata Gandikota
Nearly optimal sparse group testing. 401-408 - Josh Girson, Shuchin Aeron:
Algorithms for item categorization based on ordinal ranking data. 409-416 - Ashwin Pananjady, Martin J. Wainwright
Linear regression with an unknown permutation: Statistical and computational limits. 417-424 - Elchanan Mossel, Noah Olsman, Omer Tamuz:
Efficient Bayesian Learning in Social Networks with Gaussian Estimators. 425-432 - Nissim Zerbib, Yen-Huan Li
Estimation error of the constrained lasso. 433-438 - Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis
Finding low-rank solutions to smooth convex problems via the Burer-Monteiro approach. 439-446 - Mostafa Rahmani, George K. Atia:
In pursuit of novelty: A decentralized approach to subspace clustering. 447-451 - Ashish Cherukuri
Distributed algorithms for convex network optimization under non-sparse equality constraints. 452-459 - Bradley W. Lan, Soura Dasgupta:
Rigid formation control with nonlinear passive actuation. 460-466 - Divyanshu Vats, Andrew S. Lan, Christoph Studer, Richard G. Baraniuk:
Optimal ranking of test items using the Rasch model. 467-473 - Daniel L. Pimentel-Alarcón:
A simpler approach to low-rank tensor canonical polyadic decomposition. 474-481 - Víctor Valls, Douglas J. Leith
Subgradient methods with perturbations in network problems. 482-487 - Vamsi K. Ithapu, Sathya N. Ravi
On the interplay of network structure and gradient convergence in deep learning. 488-495 - David Hong
Towards a theoretical analysis of PCA for heteroscedastic data. 496-503 - Ashish Cherukuri
The role of strong convexity-concavity in the convergence and robustness of the saddle-point dynamics. 504-510 - Yi-Peng Wei, Sennur Ulukus:
Partial strong converse for the non-degraded wiretap channel. 511-515 - Remi A. Chou
Universal covertness for Discrete Memoryless Sources. 516-523 - Jinyuan Chen:
New results on the secure capacity of symmetric two-user interference channels. 524-531 - Kousha Kalantari, Oliver Kosut, Lalitha Sankar:
On the fine asymptotics of information theoretic privacy. 532-539 - Lei Yu
Source-channel secrecy for Shannon cipher system. 540-547 - Ramin Soltani
Covert communications on renewal packet channels. 548-555 - Nhan H. Pham
Design and implementation of an autonomous robot for steel bridge inspection. 556-562 - Thang Nguyen
Distributed flocking control of mobile robots by bounded feedback. 563-568 - Andrew J. Wagenmaker, Necmiye Ozay
A bisimulation-like algorithm for abstracting control systems. 569-576 - Pushpak Jagtap
On incremental stability of time-delayed stochastic control systems. 577-581 - Salar Fattahi, Javad Lavaei:
Theoretical guarantees for the design of near globally optimal static distributed controllers. 582-589 - Eduardo Ramírez-Llanos, Sonia Martínez:
Gradient-free distributed resource allocation via simultaneous perturbation. 590-595 - Yoshiyuki Kabashima, Tomoyuki Obuchi, Makoto Uemura
Approximate cross-validation formula for Bayesian linear regression. 596-600 - Thibault Lesieur, Caterina De Bacco
Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering. 601-608 - Kayvon Mazooji, Frederic Sala, Guy Van den Broeck, Lara Dolecek:
Robust channel coding strategies for machine learning data. 609-616 - Marwen Zorgui
Centralized multi-node repair in distributed storage. 617-624 - Jean Barbier
The mutual information in random linear estimation. 625-632 - Anuran Makur, Lizhong Zheng:
Polynomial spectral decomposition of conditional expectation operators. 633-640 - Elyas Sabeti, Anders Høst-Madsen:
Atypicality for the class of exponential family. 641-648 - Jiachun Liao, Lalitha Sankar, Vincent Y. F. Tan, Flávio P. Calmon:
Hypothesis testing in the high privacy limit. 649-656 - Kwangjun Ahn, Kangwook Lee, Changho Suh
Community recovery in hypergraphs. 657-663 - Aman Jain, Sanjeev R. Kulkarni, Sergio Verdú:
Energy efficiency of wireless cooperation. 664-671 - Natasha Devroye:
When is the zero-error capacity positive in the relay, multiple-access, broadcast and interference channels? 672-678 - Fatemeh Hosseinigoki, Oliver Kosut:
The Gaussian interference channel in the presence of a malicious jammer. 679-686 - Lei Yu
Distortion bounds for transmitting correlated sources with common part over MAC. 687-694 - Victor Exposito, Sheng Yang, Nicolas Gresset:
A two-round interactive receiver cooperation scheme for multicast channels. 695-702 - Pan Li, Baosen Zhang:
An optimal treatment assignment strategy to evaluate demand response effect. 703-710 - Faisal Alotaibi
Dynamic pricing and proactive caching with unknown demand profile. 711-716 - Reza Asadi, Solmaz S. Kia
Cycle basis distributed ADMM solution for optimal network flow problem over biconnected graphs. 717-724 - Sameh Hosny
Mobility-aware centralized D2D caching networks. 725-732 - Zhe Yu, Yunjian Xu, Lang Tong:
Deadline scheduling as restless bandits. 733-737 - Arya Mazumdar, Barna Saha:
Clustering with an oracle. 738-739 - Shih-Tang Su, Vijay G. Subramanian
Descending price algorithm for determining market clearing prices in matching markets. 740-742 - Brunella Spinelli, L. Elisa Celis, Patrick Thiran:
Observer placement for source localization: The effect of budgets and transmission variance. 743-751 - Wenji Zhang, Balasubramaniam Natarajan
State estimation in stochastic hybrid systems with quadratic guard conditions. 752-757 - Dong Yin, Ramtin Pedarsani, Xiao Li, Kannan Ramchandran:
Compressed sensing using sparse-graph codes for the continuous-alphabet setting. 758-765 - V. Sriram Siddhardh Nadendla
Towards the design of prospect-theory based human decision rules for hypothesis testing. 766-773 - Shuang Li, Yang Cao, Christina Leamon, Yao Xie, Lei Shi, Wen-Zhan Song
Online seismic event picking via sequential change-point detection. 774-779 - Asad Ullah Awan, Majid Zamani
On a notion of estimation entropy for stochastic hybrid systems. 780-785 - Jan Maximilian Montenbruck, Shen Zeng, Frank Allgöwer
On the observability properties of systems with rolling shutter. 786-791 - Gourav Saha, Alhussein A. Abouzeid
Competitive online algorithm for leasing wireless channels in 3-Tier Sharing Framework. 792-799 - Umberto Martínez-Peñas
Unifying notions of generalized weights for universal security on wire-tap networks. 800-807 - Mathieu Dahan
Network sensing for security against link disruption attacks. 808-815 - Ahmed H. Anwar
Game theoretic defense approach to wireless networks against stealthy decoy attacks. 816-821 - Nigel Boston, Jing Hao:
Quasi-Quadratic Residue Codes and their weight distributions. 822-829 - Mehrdad Tahmasbi, Matthieu R. Bloch:
Second order asymptotics for degraded wiretap channels: How good are existing codes? 830-837 - Serdar Yüksel, Naci Saldi
Strategic measures approach to decentralized stochastic control. 838-843 - Igor Kadota
Minimizing the Age of Information in broadcast wireless networks. 844-851 - Daniel Vial, Vijay G. Subramanian
Towards fast algorithms for estimating Personalized PageRank using commonly generated random walks. 852-855 - Nitin Shyamkumar, Siddhartha Banerjee, Peter Lofgren:
Sublinear estimation of a single element in sparse linear systems. 856-860 - Nick G. Duffield, Balachander Krishnamurthy:
Efficient sampling for better OSN data provisioning. 861-868 - Avleen Singh Bijral, Anand D. Sarwate
Data-dependent bounds on network gradient descent. 869-874 - Soheil Mohajer, Changho Suh
Active top-K ranking from noisy comparisons. 875-882 - Lyudmila Yartseva, Jefferson Elbert Simães, Matthias Grossglauser:
Assembling a network out of ambiguous patches. 883-890 - Charalampos E. Tsourakakis
Motif-driven graph analysis. 891-893 - Pritam Mukherjee, Sennur Ulukus:
MIMO one hop networks with no eve CSIT. 894-901 - Sara Shahi, Daniela Tuninetti
On the capacity of the AWGN channel with additive radar interference. 902-907 - Leah Dickstein, Vasuki Narasimha Swamy, Gireeja Ranade, Anant Sahai:
Finite block length coding for low-latency high-reliability wireless communication. 908-915 - Abishek Sankararaman, François Baccelli:
Spatial birth-death wireless networks. 916-923 - Jingjing Zhang, Petros Elia
Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback. 924-932 - Weina Wang, Lei Ying
Resource allocation for data-parallel computing in networks with data locality. 933-939 - Yaoqing Yang, Pulkit Grover
Fault-tolerant distributed logistic regression using unreliable components. 940-947 - Hang Zhang, Afshin Abdi, Faramarz Fekri
Error correction for approximate computing. 948-953 - Nuwan S. Ferdinand, Stark C. Draper
Anytime coding for distributed computation. 954-960 - Mohamed Adel Attia, Ravi Tandon:
On the worst-case communication overhead for distributed data shuffling. 961-968 - Alon Klein-Orbach, Yuval Kochman:
Low-redundancy bit interleaving. 969-973 - Alborz Alavian, Michael Rotkowitz:
Minimization of a particular singular value. 974-981 - Victoria Kostina
When is Shannon's lower bound tight at finite blocklength? 982-989 - Bobak Nazer, Or Ordentlich:
Diophantine approximation for network information theory: A survey of old and new results. 990-996 - Ioannis Mitliagkas, Ce Zhang, Stefan Hadjis, Christopher Ré:
Asynchrony begets momentum, with an application to deep learning. 997-1004 - Anoosheh Heidarzadeh, Alex Sprintson:
Cooperative data exchange: A coalition game perspective. 1005-1011 - Saeid Sahraei
Multi-library coded caching. 1012-1017 - Bing Zhu, Xin Li, Hui Li, Kenneth W. Shum:
Replicated convolutional codes: A design framework for repair-efficient distributed storage codes. 1018-1024 - Geonu Kim
Local erasure correction codes with unequal locality profile. 1025-1032 - Swanand Kadhe
Rank-metric codes with local recoverability. 1033-1040 - Abhishek Agarwal, Arya Mazumdar:
Bounds on the rate of linear locally repairable codes over small alphabets. 1041-1045 - July X. Li, Pascal O. Vontobel:
Factor-graph representations of stabilizer quantum codes. 1046-1053 - Alborz Alavian, Michael Rotkowitz:
Polynomial optimization methods for determining lower bounds on decentralized assignability. 1054-1059 - MirSaleh Bahavarnia, Nader Motee:
Periodic time-triggered sparse Linear Quadratic Controller design. 1060-1067 - Ali Koochakzadeh, Sina Miran, Pouya Samangouei, Michael C. Rotkowitz:
Nonnegative Matrix Factorization by optimization on the Stiefel manifold with SVD initialization. 1068-1073 - Abhay Kumar Yadav, Rajeev Ranjan, Upal Mahbub, Michael C. Rotkowitz:
New methods for handling binary constraints. 1074-1080 - Augusto Santos
Adaptive social networks: Strong attractors and emergence and downfall of leaders. 1081-1087 - Aritra Mitra, Shreyas Sundaram:
An approach for distributed state estimation of LTI systems. 1088-1093 - Julien M. Hendrickx, Samuel Martin:
Open multi-agent systems: Gossiping with deterministic arrivals and departures. 1094-1101 - Qin Ba, Ketan Savla:
On distributed computation of optimal control of traffic flow over networks. 1102-1109 - Elizabeth N. Davison, Biswadip Dey
Synchronization bound for networks of nonlinear oscillators. 1110-1115 - Nikolaos M. Freris, Panagiotis Patrinos
Distributed computing over encrypted data. 1116-1122 - Cheolhyeon Kwon, Inseok Hwang:
Recursive reachable set computation for on-line safety assessment of the Cyber-Physical System against stealthy cyber attacks. 1123-1128 - Ashish Ranjan Hota
Optimal network topologies for mitigating security and epidemic risks. 1129-1136 - Mehrdad Showkatbakhsh, Paulo Tabuada
Secure system identification. 1137-1141 - Xiaoming Duan, Nikolaos M. Freris, Peng Cheng:
Secure clock synchronization under collusion attacks. 1142-1148 - Sean Weerakkody, Bruno Sinopoli:
A moving target approach for identifying malicious sensors in control systems. 1149-1156 - Victoria Kostina
Rate-cost tradeoffs in control. 1157-1164 - Mohammad Javad Khojasteh
The value of timing information in event-triggered control: The scalar case. 1165-1172 - Pavankumar Tallapragada, Massimo Franceschetti, Jorge Cortés:
Event-triggered stabilization of scalar linear systems under packet drops. 1173-1180 - Yuankun Xue, Sérgio Pequito, Joana R. Coelho, Paul Bogdan, George J. Pappas
Minimum number of sensors to ensure observability of physiological systems: A case study. 1181-1188 - Victoria Kostina
Rate-limited control of systems with uncertain gain. 1189-1196 - Guohui Ding, Lijun Chen
Load balancing and speed scaling interaction in processor-sharing systems with exponential power functions. 1197-1203 - Anil Ömer Saritaç, Altug Karakurt, Cem Tekin:
Online Contextual Influence Maximization in social networks. 1204-1211 - Datong Zhou, Maximilian Balandat, Claire J. Tomlin:
A Bayesian perspective on Residential Demand Response using smart meter data. 1212-1219 - Asish Ghoshal, Jean Honorio
From behavior to sparse graphical games: Efficient recovery of equilibria. 1220-1227 - Ravi Kumar Kolla, Krishna P. Jagannathan
Collaborative learning of stochastic bandits over a social network. 1228-1235 - Nima Akbarzadeh, Cem Tekin:
Gambler's Ruin Bandit Problem. 1236-1243 - Sashank J. Reddi, Suvrit Sra, Barnabás Póczos, Alexander J. Smola:
Stochastic Frank-Wolfe methods for nonconvex optimization. 1244-1251 - Navid Tafaghodi Khajavi, Anthony Kuh:
The goodness of covariance selection problem from AUC bounds. 1252-1258 - Soummya Kar
Queue-based broadcast gossip algorithm for consensus. 1259-1266 - Jun Zhao
A comprehensive guideline for choosing parameters in the Eschenauer-Gligor key predistribution. 1267-1273 - Di Li, Soummya Kar
Distributed Bayesian quickest change detection in sensor networks via large deviation analysis. 1274-1281 - Federico Wadehn, Lukas Bruderer, Vijay Sahdeva, Hans-Andrea Loeliger:
New square-root and diagonalized Kalman smoothers. 1282-1290 - Tian Tong, Rohit Negi:
Asymptotic performance analysis of majority sentiment detection in Online Social Networks. 1291-1297 - Mohammad Babakmehr, Ravel Ammerman, Marcelo Godoy Simões:
Modeling and tracking Transmission Line Dynamic Behavior in Smart Grids using structured sparsity. 1298-1305 - Alessandro Zocca
Minimizing heat loss in DC networks using batteries. 1306-1313 - M. Amin Rahimian
Distributed estimation and learning over heterogeneous networks. 1314-1321 - Christopher J. Quinn:
On sparse approximations for time-series networks. 1322-1326 - Kristjan H. Greenewald, Stephen Kelley, Alfred O. Hero III:
Dynamic metric learning from pairwise comparisons. 1327-1334 - Daniel L. Pimentel-Alarcón, Laura Balzano
Necessary and sufficient conditions for sketched subspace clustering. 1335-1343
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: