default search action
50th 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
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
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
Design of string stable adaptive cruise controllers for highway and urban missions. 106-113 - Vishwesh V. Kulkarni, Theerachai Chanyaswad, Marc D. Riedel
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
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
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
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
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
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
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
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
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
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
Diffusion of innovation in two-sided markets. 426-433 - Ceyhun Eksin, Pooya Molavi, Alejandro Ribeiro
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
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
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
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
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
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
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
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
Compressed sensing of approximately-sparse signals: Phase transitions and optimal reconstruction. 800-807 - Maria Chiara Angelini
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
Resource allocation: Realizing mean-variability-fairness tradeoffs. 831-838 - Nicolò Michelusi
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
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 - Yasin Yilmaz, George V. Moustakides, Xiaodong Wang:
Sequential decentralized detection under noisy channels. 893-900 - Ali Tajer, H. Vincent Poor:
Hypothesis testing for partial sparse recovery. 901-908 - Chris Milling, Constantine Caramanis
On identifying the causative network of an epidemic. 909-914 - Barlas Oguz, Venkat Anantharam, Ilkka Norros:
Stable, distributed P2P protocols based on random peer sampling. 915-919 - Siddhartha Banerjee, Nidhi Hegde, Laurent Massoulié:
The price of privacy in untrusted recommendation engines. 920-927 - Jaron Sanders
Achievable performance in product-form networks. 928-935 - Dan P. Guralnik, Daniel E. Koditschek:
Toward a memory model for autonomous topological mapping and navigation: The case of binary sensors and discrete actions. 936-945 - Ömür Arslan
Hierarchically clustered navigation of distinct Euclidean particles. 946-953 - Masahito Hayashi, Ryutaroh Matsumoto
Secure multiplex coding with dependent and non-uniform multiple messages. 954-959 - Theodoros K. Dikaliotis, Hongyi Yao, Tracey Ho, Michelle Effros, Jörg Kliewer:
Network equivalence in the presence of an eavesdropper. 960-967 - Curt Schieler, Eva C. Song, Paul Cuff, H. Vincent Poor:
Source-channel secrecy with causal disclosure. 968-973 - Ninoslav Marina
Increasing the information-theoretic secrecy by cooperative relaying and jamming. 974-981 - Zohaib Hassan Awan, Abdellatif Zaidi, Luc Vandendorpe:
On multiaccess channel with unidirectional cooperation and security constraints. 982-987 - Mohammad Kazemi, Azadeh Vosoughi:
Capacity region and optimum power allocation strategies for fading cognitive relay multiple access channels. 988-995 - Lav R. Varshney:
Participation in crowd systems. 996-1001 - Apostol T. Gjika, Marco Levorato, Antonio Ortega, Urbashi Mitra:
Online learning in wireless networks via directed graph lifting transform. 1002-1009 - Guangyu Zhou, Xiaochen Zhao, Wei Dai:
Low rank matrix completion: A smoothed l0-search. 1010-1017 - Samet Oymak, Babak Hassibi:
On a relation between the minimax risk and the phase transitions of compressed recovery. 1018-1025 - Gautam Dasarathy
Covariance sketching. 1026-1033 - Naresh Sharma, Naqueeb Ahmad Warsi:
Non-asymptotic information theoretic bound for some multi-party scenarios. 1034-1041 - Nikhil Karamchandani, Urs Niesen, Suhas N. Diggavi:
Computation over mismatched channels. 1042-1048 - Changho Suh
Computation in multicast networks: Function alignment and converse theorems. 1049-1056 - Sudeep Kamath, Venkat Anantharam:
Non-interactive simulation of joint distributions: The Hirschfeld-Gebelein-Rényi maximal correlation and the hypercontractivity ribbon. 1057-1064 - Yu Xiang, Young-Han Kim:
Interactive hypothesis testing with communication constraints. 1065-1072 - Pablo A. Ruiz, Aleksandr Rudkevich, Michael C. Caramanis, Evgeniy Goldis, Elli Ntakou, C. Russ Philbrick:
Reduced MIP formulation for transmission topology control. 1073-1079 - Aleksandr Rudkevich:
A nodal capacity market for co-optimization of generation and transmission expansion. 1080-1088 - Michael C. Caramanis, Evgeniy Goldis, Pablo A. Ruiz, Aleksandr Rudkevich:
Power market reform in the presence of flexible schedulable distributed loads. New bid rules, equilibrium and tractability issues. 1089-1096 - Luciano Irineu de Castro, Peter Cramton
Prediction markets for electricity demand. 1097-1104 - Mahdi Kefayati, Ross Baldick:
Harnessing demand flexibility to match renewable production using localized policies. 1105-1109 - Ramakrishna Gummadi, Ramesh Johari, Jia Yuan Yu:
Mean field equilibria of multi armed bandit games. 1110 - Arastoo Fazeli, Ali Jadbabaie:
Targeted marketing and seeding products with positive externality. 1111-1117 - Michael Mitzenmacher, Justin Thaler:
Peeling arguments and double hashing. 1118-1125 - Michael Mitzenmacher, George Varghese:
The complexity of object reconciliation, and open problems related to set difference and coding. 1126-1132 - Vo Tam Van, Chau Yuen, Jing (Tiffany) Li:
Non-homogeneous distributed storage systems. 1133-1140 - Amit Berman
Probabilistic performance of write-once memory with Linear Wom codes - Analysis and insights. 1141-1149 - Natalia Silberstein, Ankit Singh Rawat
Error resilience in distributed storage via rank-metric codes. 1150-1157 - Mohammad Reza Zakerinasab, Mea Wang:
An update model for network coding in cloud storage systems. 1158-1165 - Karthikeyan Shanmugam
A repair framework for scalar MDS codes. 1166-1173 - Oktay Ölmez, Aditya Ramamoorthy:
Repairable replication-based storage systems using resolvable designs. 1174-1181 - Matthew Thill, Babak Hassibi:
Frames, group codes, and subgroups of (Z/pZ)×. 1182-1189 - Antonios Pitarokoilis, Saif Khan Mohammed, Erik G. Larsson:
Effect of oscillator phase noise on uplink performance of large MU-MIMO systems. 1190-1197 - Günther Koliander
A lower bound on the noncoherent capacity pre-log for the MIMO channel with temporally correlated fading. 1198-1205 - Srinivas Yerramalli, Rahul Jain
Characterization of equilibria for the degraded Gaussian broadcast and sum power MAC channels. 1206-1212 - Yue Zhao, Suhas N. Diggavi, Andrea Goldsmith, H. Vincent Poor:
Convex optimization for precoder design in MIMO interference networks. 1213-1219 - Narayanan Krishnan, Roy D. Yates, Narayan B. Mandayam:
Cellular systems with many antennas: Large system analysis under pilot contamination. 1220-1224 - Nan Liu, Wei Kang:
Capacity results for a class of Z channels with degraded message sets. 1225-1231 - Alex Dytso
The sum-capacity of the symmetric linear deterministic Complete K-user Z-Interference Channel. 1232-1237 - Ranga Prasad, N. Srinidhi, A. Chockalingam:
Bounds on the sum-rate capacity of the Gaussian MIMO X channel. 1238-1245 - Dor-Joseph Kampeas, Asaf Cohen, Omer Gurewitz:
Capacity of distributed opportunistic scheduling in heterogeneous networks. 1246-1253 - Jinyuan Chen, Petros Elia
Can imperfect delayed CSIT be as useful as perfect delayed CSIT? DoF analysis and constructions for the BC. 1254-1261 - Namyoon Lee
Not too delayed CSIT achieves the optimal degrees of freedom. 1262-1269 - Christoph Studer, Wotao Yin
Signal representations with minimum ℓ∞-norm. 1270-1277 - Andreas Winkelbauer, Gerald Matz:
Blind estimation of bit and block error probabilities using soft information. 1278-1285 - Bans Fidan, Ahmet Camlica:
Least-squares based adaptive source localization by mobile agents. 1286-1291 - Kartik Venkat, Tsachy Weissman, Yair Carmon, Shlomo Shamai
On information, estimation and lookahead. 1292-1299 - Alexander R. Borden, Daniel K. Molzahn, Parmeswaran Ramanathan, Bernard C. Lesieutre:
Confidentiality-preserving optimal power flow for cloud computing. 1300-1307 - Efthymios Karangelos
Integrating Demand Response into agent-based models of electricity markets. 1308-1315 - Joshua A. Taylor, Johanna L. Mathieu
Price and capacity competition in zero-mean storage and demand response markets. 1316-1323 - Gabriela Hug:
Generation cost and system risk trade-off with corrective power flow control. 1324-1331 - Mengran Xue, Ian A. Hiskens:
An enhanced MPC-based strategy for non-disruptive load shedding. 1332-1337 - Jong Min Lim, Christopher L. DeMarco:
Estimating power flow conditioning from phasor measurement data. 1338-1346 - Kangwook Lee, Hao Zhang, Ziyu Shao, Minghua Chen
An optimized distributed video-on-demand streaming system: Theory and design. 1347-1354 - Balaji Prabhakar, Katherine N. Dektar, Deborah M. Gordon:
Anternet: The regulation of harvester ant foraging and Internet congestion control. 1355-1359 - Aakanksha Chowdhery, Ranveer Chandra, Paul Garnett, Paul Mitchell:
Characterizing spectrum goodness for dynamic spectrum access. 1360-1367 - Rajdeep Singh, Kartik B. Ariyur:
Quantifying the security of physical facilities: A game theoretic framework. 1368-1373 - Ashish Khisti:
Interactive secret key generation over reciprocal fading channels. 1374-1381 - Wei Kang, Nan Liu:
Compressing encrypted data: A permutation approach. 1382-1386 - Flávio du Pin Calmon, Muriel Médard, Linda M. Zeger, João Barros
Lists that are smaller than their parts: A coding approach to tunable secrecy. 1387-1394 - Chouchang Yang, Basel Alomair
Multipath flow allocation in anonymous wireless networks with dependent sources. 1395-1400 - Flávio du Pin Calmon, Nadia Fawaz
Privacy against statistical inference. 1401-1408 - Vinod Ramaswamy, Sachin Adlakha, Srinivas Shakkottai, Adam Wierman:
Incentives for P2P-assisted content distribution: If you can't beat 'em, join 'em. 1409-1416 - Xiaohan Kang, Juan José Jaramillo
Impacts of peer churn on P2P streaming networks. 1417-1424 - Sadegh Bolouki, Roland P. Malhamé
Theorems about ergodicity and class-ergodicity of chains with applications in known consensus models. 1425-1431 - Mohammad N. Sefat, Abdul Bais
A theoretical framework for analysis of communication pathways in random networks. 1432-1437 - Wenxiang Dong
Extracting influential information sources for gossiping. 1438-1444 - Victor L. Minden, Clifford C. Youn, Usman A. Khan:
A distributed self-clustering algorithm for autonomous multi-agent systems. 1445-1448 - Georgios Kotsalis, Jeff S. Shamma:
A fundamental limitation to the reduction of Markov chains via aggregation. 1449-1454 - Peter Davison, Michael Schwemmer, Naomi Ehrich Leonard:
Distributed nonuniform coverage with limited scalar measurements. 1455-1460 - Nitin K. Singh, Mehmet Eren Ahsen
A novel application of mixing coefficients for reverse-engineering gene interaction networks. 1461-1466 - Jean-Camille Birget, Desmond S. Lun, Anthony Wirth
Identification of binary gene networks. 1467-1474 - Wei Zhang, Chao Xu, Chin-Yao Chang:
Demand dynamics aggregation using hybrid systems. 1475-1481 - Thinh Thanh Doan, Choon Yik Tang:
Continuous-time constrained distributed convex optimization. 1482-1489 - Biswadip Dey
Trajectory smoothing as a linear optimal control problem. 1490-1497 - Bassam Bamieh
Structured stochastic uncertainty. 1498-1503 - Danielle C. Tarraf:
Constructing ρ/μ approximations from input/output snapshots for systems over finite alphabets. 1504-1509 - Poorya Haghi, Kartik B. Ariyur:
Adapting first order nonlinear systems using extremum seeking. 1510-1516 - Farooq Khan, Zhouyue Pi, Sridhar Rajagopal:
Millimeter-wave mobile broadband with large scale spatial processing for 5G mobile communication. 1517-1523 - Vignesh Sethuraman, Hairuo Zhuang, Shahab Sanayei:
HARQ over correlated fading. 1524-1528 - Jubin Jose, Sundar Subramanian, Xinzhou Wu, Junyi Li:
Opportunistic interference alignment in cellular downlink. 1529-1534 - Jianshu Chen, Ali H. Sayed:
On the limiting behavior of distributed optimization strategies. 1535-1542 - Konstantinos I. Tsianos, Sean F. Lawlor, Michael G. Rabbat:
Consensus-based distributed optimization: Practical issues and applications in large-scale machine learning. 1543-1550 - Saman Ashkiani, Anna Scaglione
Pulse Coupled Discrete Oscillators dynamics for network scheduling. 1551-1558 - Dusan Jakovetic, José M. F. Moura, João Manuel Freitas Xavier:
Consensus+innovations detection: Phase transition under communication noise. 1559-1563 - John C. Duchi, Alekh Agarwal, Martin J. Wainwright
Dual averaging for distributed optimization. 1564-1565 - Nicholas Ruozzi:
Convergent message-passing algorithms in the presence of erasures. 1566-1571 - Xishuo Liu, Stark C. Draper
The l1 penalized decoder and its reweighted LP. 1572-1579 - Congduan Li, John MacLaren Walsh, Steven Weber:
A computational approach for determining rate regions and codes using entropic vector bounds. 1580-1587 - Nigel Boston, Ting-Ting Nan:
Large violations of the Ingleton inequality. 1588-1593 - Houssam Abbas, Georgios Fainekos
Convergence proofs for Simulated Annealing falsification of safety properties. 1594-1601 - Pavithra Prabhakar:
Foundations for approximation based analysis of stability properties of hybrid systems. 1602-1609 - Sriram Sankaranarayanan, Christopher Miller, Rangarajan Raghunathan, Hadi Ravanbakhsh, Georgios Fainekos
A model-based approach to synthesizing insulin infusion pump usage parameters for diabetic patients. 1610-1617 - Jerome Le Ny, George J. Pappas
Differentially private Kalman filtering. 1618-1625 - Mohammad Naghshvar, Tara Javidi
Noisy Bayesian active learning. 1626-1633 - Tien V. Nguyen, François Baccelli, Kai Zhu, Sundar Subramanian, Xinzhou Wu:
When does CSMA become ALOHA? 1634-1636 - Jian Tan, Shicong Meng, Xiaoqiao Meng, Li Zhang:
Delay asymptotics for heavy-tailed MapReduce jobs. 1637-1639 - Deepanshu Vasal, Achilleas Anastasopoulos:
Achieving socially optimal solution through payments in a dynamic game for the relay channel. 1640-1644 - K. Ishaque Ashar, V. Prathyusha, Srikrishna Bhashyam
Outer bounds for the capacity region of a Gaussian two-way relay channel. 1645-1652 - Kanghee Lee, Hyuck M. Kwon, Wenhao Xiong, Hyunggi Kim, Shuang Feng, Hyuncheol Park, Yong Hoon Lee:
Two-level MMSE relay strategy for an AF wireless relay network. 1653-1658 - Ying Liu, K. D. Prathapasinghe Dharmawansa, Matthew R. McKay
Max-flow min-cut outage characterization of dual-hop relay channels. 1659-1665 - Ali S. Khayrallah:
SLIC equalizer for ISI. 1666-1671 - Ansuman Adhikary, Mari Kobayashi, Pablo Piantanida, Haralabos C. Papadopoulos, Giuseppe Caire:
CSI dissemination for MU-MIMO schemes based on outdated CSI. 1672-1679 - Yufei W. Blankenship:
Achieving high capacity with small cells in LTE-A. 1680-1687 - Varada Potnis, Vinod Sharma
Modelling and analysis of New Coolstreaming for P2P IPTV. 1688-1696 - Randall Berry
Spotting trendsetters: Inference for network games. 1697-1704 - Matthew Andrews, Lisa Zhang:
Energy-delay tradeoffs in a load-balanced router. 1705-1712 - Alexander L. Stolyar:
An infinite server system with customer-to-server packing constraints. 1713-1720 - Yousi Zheng, Prasun Sinha, Ness B. Shroff:
Performance analysis of work-conserving schedulers for minimizing total flow-time with phase precedence. 1721-1728 - Usman A. Khan:
Coordinated randomness in sparse graphs. 1729-1733 - Haotian Zhang, Shreyas Sundaram
A simple median-based resilient consensus algorithm. 1734-1741 - Heath LeBlanc, Xenofon D. Koutsoukos:
Resilient asymptotic consensus in asynchronous robust networks. 1742-1749 - Yash Deshpande, Andrea Montanari:
Linear bandits in high dimension and recommendation systems. 1750-1754 - David Stotz, Helmut Bölcskei:
Degrees of freedom in vector interference channels. 1755-1760 - Henning Maier, Johannes Schmitz, Rudolf Mathar:
Cyclic Interference Alignment by propagation delay. 1761-1768 - Mojtaba Vaezi:
The capacity of less noisy cognitive interference channels. 1769-1774 - Suvarup Saha, Randall A. Berry
Symmetric K-user Gaussian interference channels: Approximate sum-capacity via deterministic modeling. 1775-1782 - Zhiyu Cheng, Natasha Devroye:
On constant gaps for the two-way Gaussian interference channel. 1783-1789 - Samir Medina Perlaza
The Nash equilibrium region of the linear deterministic interference channel with feedback. 1790-1797 - Lillian J. Ratliff
Pricing in linear-quadratic dynamic games. 1798-1805 - André Teixeira
Revealing stealthy attacks in control systems. 1806-1813 - Andrew Clark, Linda Bushnell
A passivity-based framework for composing attacks on networked control systems. 1814-1821 - Milind Tambe, Manish Jain, James Adam Pita, Albert Xin Jiang:
Game theory for security: Key algorithmic principles, deployed systems, lessons learned. 1822-1829 - Alvaro A. Cárdenas
A game theory model for electricity theft detection and privacy-aware control in AMI systems. 1830-1837 - Christoph Bunte, Amos Lapidoth:
The zero-undetected-error capacity of discrete memoryless channels with feedback. 1838-1842 - Mayur Agrawal, David J. Love, Venkataramanan Balakrishnan
A lower bound on feedback capacity of colored Gaussian relay channels. 1843-1849 - I-Hsiang Wang, Changho Suh
Feedback increases the degrees of freedom of two unicast Gaussian networks. 1850-1855 - Chong Li, Nicola Elia:
Noisy feedback communications with side information at the decoder. 1856-1863 - Sy-Quoc Le, Ravi Tandon, Mehul Motani
The capacity region of the symmetric linear deterministic interference channel with partial feedback. 1864-1871 - Ehsan Karamad, Raviraj S. Adve:
Performance loss minimization in cooperative networks based on quantized channel feedback. 1872-1878 - Liyan Jia, Lang Tong:
Optimal pricing for residential demand response: A stochastic optimization approach. 1879-1884 - Iman Shames
Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs. 1885-1892 - Subhonmesh Bose, Steven H. Low, K. Mani Chandy:
Equivalence of branch flow and bus injection models. 1893-1899 - Ram Rajagopal, David Tse, Baosen Zhang:
Risk limiting dispatch in congested networks. 1900-1907 - He Hao, Timothy Middelkoop
How demand response from commercial buildings will provide the regulation needs of the grid. 1908-1913 - Mark Braverman:
Coding for interactive computation: Progress and challenges. 1914-1921 - Sae-Young Chung:
Decomposition of discrete memoryless sources. 1922-1927 - Ayan Sengupta, I-Hsiang Wang, Christina Fragouli:
Optimizing quantize-map-and-forward in slow fading relay networks. 1928-1934 - Ilan Shomorony, Amir Salman Avestimehr:
Degrees of freedom of two-hop wireless networks: "Everyone gets the entire cake". 1935-1942 - Sameer Pawar, Kannan Ramchandran:
A hybrid DFT-LDPC framework for fast, efficient and robust compressive sensing. 1943-1950 - Jonathan Scarlett, Alfonso Martinez
Ensemble-tight error exponents for mismatched decoders. 1951-1958 - Reza Khosravi-Farsani:
How much rate splitting is required for a random coding scheme?: A new achievable rate region for the Broadcast Channel with Cognitive Relays. 1959-1965 - Ramji Venkataramanan, Sekhar Tatikonda:
Sparse regression codes for multi-terminal source and channel coding. 1966-1974 - Jonathan Scarlett, Albert Guillen i Fabregas
An achievable error exponent for the mismatched multiple-access channel. 1975-1982 - Mainak Chowdhury, Andrea Goldsmith, Tsachy Weissman:
Uncoded transmission in MAC channels achieves arbitrarily small error probability. 1983-1990 - Saeed Hajizadeh, Mostafa Monemizadeh, Ghosheh Abed Hodtani
A coding theorem for the discrete memoryless compound multiple access channel with common message and generalized feedback. 1991-1996 - Saeed Hajizadeh, Ghosheh Abed Hodtani
Asymmetric Broadcast Channels. 1997-2002 - Yuejie Chi
Coherence-based performance guarantees of Orthogonal Matching Pursuit. 2003-2009 - Zhenliang Zhang, Edwin K. P. Chong, Ali Pezeshki, William Moran, Stephen D. Howard:
Rate of learning in hierarchical social networks. 2010-2017 - Babak Fotouhi
Growing a network on a given substrate. 2018-2023 - Avik Ray, Sujay Sanghavi, Sanjay Shakkottai:
Greedy learning of graphical models with small girth. 2024-2031 - Sahand Negahban, Devavrat Shah:
Learning sparse Boolean polynomials. 2032-2036 - Farrokh Etezadi, Ashish Khisti:
Real-time coding of Gauss-Markov sources over burst erasure channels. 2037-2044 - John Z. Sun, Vivek K. Goyal
Chatting in distributed quantization networks. 2045-2052 - Ahmad Beirami, Faramarz Fekri
Network Compression: Memory-assisted universal coding of sources with correlated parameters. 2053-2059 - Mehdi Torbatian, En-Hui Yang:
Causal coding of multiple jointly Gaussian sources. 2060-2067 - Aria Ghasemian Sahebi, S. Sandeep Pradhan:
On distributed source coding using Abelian group codes. 2068-2074 - Arya Mazumdar, Ligong Wang:
Covering arbitrary point patterns. 2075-2080 - Obaid Ur Rehman, Natasa Zivic:
Noise tolerant image authentication with error localization and correction. 2081-2087 - Sanghoon Kim, Wayne E. Stark:
On the energy-throughput tradeoffs for relay networks with transmit power control. 2088-2095 - Jörg Bühler, Slawomir Stanczak:
Energy-efficient decode and forward relaying in diamond networks. 2096-2103 - Matthew S. Nokleby, Bobak Nazer, Behnaam Aazhang:
Relay computation: Managing interference with structure and cooperation. 2104-2111 - Kevin Luo, Ramy H. Gohary, Halim Yanikomeroglu
A decoding procedure for compress-and-forward and quantize-and-forward relaying. 2112-2119 - V. Sriram Siddhardh Nadendla
An auction-based mechanism for dynamic spectrum allocation in participatory cognitive radio networks. 2120-2126
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: