default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID53rd Allerton Conference 2015: Monticello, IL, USA
- 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, Allerton Park & Retreat Center, Monticello, IL, USA, September 29 - October 2, 2015. IEEE 2015, ISBN 978-1-5090-1824-6
- Angelia Nedich
, Minh N. Do:
Foreword. - Anusha Lalitha, Tara Javidi:
On the rate of learning in distributed hypothesis testing. 1-8 - Julien M. Hendrickx, John N. Tsitsiklis:
Fundamental limitations for anonymous distributed systems with broadcast communications. 9-16 - Mohsen Ghassemi, Anand D. Sarwate:
Distributed proportional stochastic coordinate descent with social sampling. 17-24 - Sean Warnick:
Shared hidden state and network representations of interconnected dynamical systems. 25-32 - Ehsan Kazemi, Lyudmila Yartseva, Matthias Grossglauser:
When can two unlabeled networks be aligned under partial overlap? 33-42 - Chenguang Zhu, Hossein Karkeh Abadi, Balaji Prabhakar:
Polling one's friends: A graph theoretic view. 43-50 - Keith Paarporn, Ceyhun Eksin, Joshua S. Weitz, Jeff S. Shamma:
Epidemic spread over networks with agent awareness and social distancing. 51-57 - Parinaz Naghizadeh, Mingyan Liu:
Provision of non-excludable public goods on networks: From equilibrium to centrality measures. 58-65 - Maria Chiara Angelini, Francesco Caltagirone, Florent Krzakala, Lenka Zdeborová:
Spectral detection on sparse hypergraphs. 66-73 - Abhishek Sinha, Pradeepkumar Mani, Jie Liu, Ashley Flavel, David A. Maltz:
Distributed load management in anycast-based CDNs. 74-82 - Shanyu Zhou, Hulya Seferoglu:
Blocking avoidance in transportation systems. 83-90 - Andrés Ferragut, Fernando Paganini:
Queueing analysis of service deferrals for load management in power systems. 91-98 - Kangwook Lee, Ramtin Pedarsani, Kannan Ramchandran:
On scheduling redundant requests with cancellation overheads. 99-106 - Gauri Joshi, Emina Soljanin, Gregory W. Wornell:
Efficient replication of queued tasks for latency reduction in cloud systems. 107-114 - Marc Vuffray, Theodor Misiakiewicz:
Concentration to zero bit-error probability for regular LDPC codes on the binary symmetric channel: Proof by loop calculus. 115-124 - Santhosh Kumar, Avinash Vem, Krishna R. Narayanan, Henry D. Pfister:
Spatially-coupled codes for write-once memories. 125-131 - Haewon Jeong, Pulkit Grover:
Energy-adaptive codes. 132-139 - Francisco Lázaro Blasco, Gianluigi Liva, Gerhard Bauch:
Inactivation decoding analysis for LT codes. 140-146 - Lele Wang, Young-Han Kim:
Linear code duality between channel coding and Slepian-Wolf coding. 147-152 - Harsha Honnappa:
Rare events of marked finite point processes. 153-159 - Oron Sabag, Haim H. Permuter, Navin Kashyap:
The feedback capacity of the binary symmetric channel with a no-consecutive-ones input constraint. 160-164 - Chung-Han Hsieh, B. Ross Barmish:
On Kelly betting: Some limitations. 165-172 - Xinyang Zhou, Masoud Farivar, Lijun Chen:
Pseudo-gradient based local voltage control in distribution networks. 173-180 - Saeed Manaffam, Alireza Seyedi, Azadeh Vosoughi, Tara Javidi:
Bounded stability in networked systems with parameter mismatch and adaptive decentralized estimation. 181-186 - Gregory S. Ledva, Laura Balzano, Johanna L. Mathieu:
Inferring the behavior of distributed energy resources with online learning. 187-194 - Maria Gabriela Martinez, Jialin Liu, Bowen Li, Johanna L. Mathieu, C. Lindsay Anderson:
Enabling renewable resource integration: The balance between robustness and flexibility. 195-202 - Subhonmesh Bose:
On the design of wholesale electricity markets under uncertainty. 203-210 - Sairaj V. Dhople, Swaroop S. Guggilam, Yu Christine Chen:
Linear approximations to AC power flow in rectangular coordinates. 211-217 - Dileep M. Kalathil, Ram Rajagopal:
Online learning for demand response. 218-222 - Jiale Hu, Lalitha Sankar, Darakhshan J. Mir:
Cluster-and-Connect: An algorithmic approach to generating synthetic electric power network graphs. 223-230 - Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Applications of polymatroid theory to distributed storage systems. 231-237 - Raphaël M. Jungers, Atreyee Kundu, W. P. M. H. Heemels:
On observability in networked control systems with packet losses. 238-243 - Shreyas Sundaram, Bahman Gharesifard:
Consensus-based distributed optimization with malicious nodes. 244-249 - Wei Wang, Choon Yik Tang:
Distributed estimation of betweenness centrality. 250-257 - Bryan Van Scoy, Randy A. Freeman, Kevin M. Lynch:
Exploiting memory in dynamic average consensus. 258-265 - Kianoush Hosseini, Wei Yu, Raviraj S. Adve:
Optimizing large-scale MIMO cellular downlink: Multiplexing, diversity, or interference nulling? 266-270 - Peruru Subrahmanya Swamy, Radha Krishna Ganti, Krishna P. Jagannathan:
Adaptive CSMA under the SINR model: Fast convergence through local gibbs optimization. 271-278 - Toshiyuki Tanaka, Kumar Shashi Prabh:
Mean-field hard-core model of interference in ad-hoc wireless networks. 279-285 - Tanumay Datta, Sheng Yang:
Improving MIMO detection performance in presence of phase noise using norm difference criterion. 286-292 - Jeffrey Wildman, Yusuf Osmanlioglu, Steven Weber, Ali Shokoufandeh:
A primal-dual approach to delay minimizing user association in cellular networks. 293-300 - Mehdi Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang:
Energy harvesting communication using limited battery with efficiency. 301-306 - Parisa Babaheidarian, Somayeh Salimi, Panos Papadimitratos:
Finite-SNR regime analysis of the Gaussian wiretap multiple-access channel. 307-314 - Joyson Sebastian, Can Karakus, Suhas N. Diggavi, I-Hsiang Wang:
Rate splitting is approximately optimal for fading Gaussian interference channels. 315-321 - Sunghyun Kim, Changho Suh:
Degrees of freedom of bursty multiple access channels with a relay. 322-328 - Qianrui Li, Paul de Kerret, David Gesbert, Nicolas Gresset:
Robust regularized ZF in decentralized Broadcast Channel with correlated CSI noise. 329-336 - Weina Wang, Matthew Barnard, Lei Ying:
Decentralized scheduling with data locality for data-parallel computation on peer-to-peer networks. 337-344 - Javad Ghaderi:
Simple high-performance algorithms for scheduling jobs in the cloud. 345-352 - Mathieu Dahan, Saurabh Amin:
Network flow routing under strategic link disruptions. 353-360 - Braden Soper, John Musacchio:
A non-zero-sum, sequential detection game. 361-371 - Mikael Touati, Rachid El Azouzi, Marceau Coupechoux, Eitan Altman, Jean-Marc Kelif:
Controlled matching game for user association and resource allocation in multi-rate WLANs? 372-380 - Bernard C. Lesieutre, Dan Wu:
An efficient method to locate all the load flow solutions - revisited. 381-388 - Zhe Yu, Yunjian Xu, Lang Tong:
Large scale charging of electric vehicles: A multi-armed bandit approach. 389-395 - Dariush Fooladivanda, Joshua A. Taylor:
Dispatching thermal power plants under water constraints. 396-401 - Saverio Bolognani, Florian Dörfler:
Fast power system analysis via implicit linearization of the power flow manifold. 402-409 - Christos Thrampoulidis, Ehsan Abbasi, Babak Hassibi:
Precise high-dimensional error analysis of regularized M-estimators. 410-417 - Jie Ding, Mohammad Noshad, Vahid Tarokh:
Data-driven learning of the number of states in multi-state autoregressive models. 418-425 - Georg Pichler, Pablo Piantanida, Gerald Matz:
Distributed information-theoretic biclustering of two memoryless sources. 426-433 - Ganesh Ajjanagadde, Yury Polyanskiy:
Adder MAC and estimates for Rényi entropy. 434-441 - Sivaramakrishnan Natarajan Ramamoorthy, Makrand Sinha:
On the communication complexity of greater-than. 442-444 - Yaoqing Yang, Pulkit Grover, Soummya Kar:
Information dissipation in noiseless lossy in-network function computation. 445-452 - Steffen Limmer, Jafar Mohammadi, Slawomir Stanczak:
A simple algorithm for approximation by nomographic functions. 453-458 - Siddharth Pal, Richard J. La:
Simple learning in weakly acyclic games and convergence to Nash equilibria. 459-466 - Abhinav Sinha, Achilleas Anastasopoulos:
Mechanism design for fair allocation. 467-473 - Weina Wang, Lei Ying, Junshan Zhang:
A game-theoretic approach to quality control for collecting privacy-preserving data. 474-479 - Syrine Krichene, Walid Krichene, Roy Dong, Alexandre M. Bayen:
Convergence of heterogeneous distributed learning in stochastic routing games. 480-487 - Francisco F. C. Rego, Ye Pu, Andrea Alessandretti, A. Pedro Aguiar, Colin N. Jones:
A consensus algorithm for networks with process noise and quantization error. 488-495 - Anoosheh Heidarzadeh, Alex Sprintson:
Cooperative data exchange with unreliable clients. 496-503 - Amir Salimi, Muriel Médard, Shuguang Cui:
On the representability of integer polymatroids: Applications in linear code construction. 504-508 - Liyasi Wu:
Revisiting the multiplicity codes: A new class of high-rate locally correctable codes. 509-513 - Youlong Wu:
Coding schemes for discrete memoryless multicast networks with and without feedback. 514-521 - Jing Guo, Jossy Sayir, Minghai Qin, Albert Guillen i Fabregas:
An alternative proof of channel polarization for channels with arbitrary input alphabets. 522-529 - Xiaohu Wu, Patrick Loiseau:
Algorithms for scheduling deadline-sensitive malleable tasks. 530-537 - Gopal Krishna Kamath, Krishna P. Jagannathan, Gaurav Raina:
Car-following models with delayed feedback: Local stability and Hopf bifurcation. 538-545 - Aftab Ahmed, Erik I. Verriest:
Design of linear & nonlinear observers for a turning process with implicit State-Dependent Delay. 546-551 - Rahul Singh, Panganamala Ramana Kumar, Le Xie:
The ISO problem: Decentralized stochastic control via bidding schemes. 552-559 - Milos Cvetkovic, Marija D. Ilic:
Interaction variables for distributed numerical integration of nonlinear power system dynamics. 560-566 - Naci Saldi, Serdar Yüksel, Tamás Linder:
Finite-state approximations to constrained Markov decision processes with Borel spaces. 567-572 - Andrey Gushchin, Anwar Walid, Ao Tang:
Enabling service function chaining through routing optimization in software defined networks. 573-581 - Bahar Partov, Douglas J. Leith:
Utility fair RAT selection in multi-homed LTE/802.11 networks. 582-589 - Radoslav Ivanov, Nikolay Atanasov, Miroslav Pajic, George J. Pappas, Insup Lee:
Robust estimation using context-aware filtering. 590-597 - Shahin Shahrampour, Alexander Rakhlin, Ali Jadbabaie:
Finite-time analysis of the distributed detection problem. 598-603 - Pavankumar Tallapragada, Massimo Franceschetti, Jorge Cortés:
Event-triggered stabilization of linear systems under channel blackouts. 604-611 - Ramtin Pedarsani, Kangwook Lee, Kannan Ramchandran:
Sparse covariance estimation based on sparse-graph codes. 612-619 - Yanina Y. Shkel, Vincent Y. F. Tan, Stark C. Draper:
Second-order coding rate for m-class source-channel codes. 620-626 - Sudeep Kamath:
Reverse hypercontractivity using information measures. 627-633 - Yunshu Liu, John MacLaren Walsh:
Non-isomorphic distribution supports for calculating entropic vectors. 634-641 - Yucel Altug, H. Vincent Poor, Sergio Verdú:
Variable-length channel codes with probabilistic delay guarantees. 642-649 - Ali Mousavi, Richard G. Baraniuk:
An information-theoretic measure of dependency among variables in large datasets. 650-657 - Fanny Yang, Sivaraman Balakrishnan, Martin J. Wainwright:
Statistical and computational guarantees for the Baum-Welch algorithm. 658-665 - Shuchin Aeron, Eric Kernfeld:
Group-invariant Subspace Clustering. 666-671 - Praveen Venkatesh, Pulkit Grover:
Is the direction of greater Granger causal influence the same as the direction of information flow? 672-679 - Thibault Lesieur, Florent Krzakala, Lenka Zdeborová:
MMSE of probabilistic low-rank matrix estimation: Universality with respect to the output channel. 680-687 - Weiran Wang, Raman Arora, Karen Livescu, Nathan Srebro:
Stochastic optimization for deep CCA via nonlinear orthogonal iterations. 688-695 - Antonia Wachter-Zeh, Eitan Yaakobi:
Masking trapped charge in flash memories. 696-703 - Minghai Qin, Robert Mateescu, Cyril Guyot, Zvonimir Bandic:
Balanced codes for data retention of multi-level flash memories with fast page read. 704-711 - Qing Li, Huan Chang, Anxiao Jiang, Erich F. Haratsch:
Joint decoding of content-replication codes for flash memories. 712-719 - Qing Li, Anxiao Jiang:
Polar codes for Secure Write-Efficient Memories. 720-727 - Majid Khabbazian:
Near-optimal multi-version codes. 728-732 - Yuanzhang Xiao, Chaithanya Bandi, Ermin Wei:
Efficiency of supply function equilibrium in networked markets. 733-735 - Desmond W. H. Cai, Enrique Mallada, Adam Wierman:
Distributed optimization decomposition for joint economic dispatch and frequency regulation. 736 - Sanmay Das, Emir Kamenica:
Representations of information structures. 737-743 - Chang Liu, Yuanzhang Xiao, Ermin Wei, Randall A. Berry:
Investment and competition with positive externalities in open networks. 744-746 - Hoi-To Wai, Anna Scaglione, Amir Leshem:
Identifying trust in social networks with stubborn agents, with application to market decisions. 747-754 - Giacomo Como, Enrico Lovisari, Ketan Savla:
Convex formulations of dynamic network traffic assignment for control of freeway networks. 755-762 - Yu Wu, Matthew Barnard, Lei Ying:
Architecture and implementation of an information-centric device-to-device network. 763-771 - Sadra Sadraddini, Calin Belta:
Robust temporal logic model predictive control. 772-779 - Huanyu Ding, David A. Castañón:
Optimal multi-vehicle adaptive search with entropy objectives. 780-785 - Jayakrishnan Unnikrishnan, Saeid Haghighatshoar, Martin Vetterli:
Unlabeled sensing: Solving a linear system with unordered measurements. 786-793 - V. Sriram Siddhardh Nadendla, Sijia Liu, Pramod K. Varshney:
Design of transmit-diversity schemes in detection networks under secrecy constraints. 794-801 - Mostafa Rahmani, George K. Atia:
A decentralized approach to robust subspace recovery. 802-807 - Javad Heydari, Ali Tajer, H. Vincent Poor:
Quickest detection of Gauss-Markov random fields. 808-814 - Bingwen Zhang, Jun Geng, Lifeng Lai:
Change-point estimation in high dimensional linear regression models via sparse group Lasso. 815-821 - George V. Moustakides:
Optimum Shewhart tests for Markovian data. 822-826 - Yang Cao, Yao Xie:
Multi-sensor gradual change detection. 827-834 - V. Lalitha, Satyanarayana V. Lokam:
Weight enumerators and higher support weights of maximally recoverable codes. 835-842 - Fatemeh Arbabjolfaei, Young-Han Kim:
Three stories on a two-sided coin: Index coding, locally recoverable distributed storage, and guessing games on graphs. 843-850 - Vitaly Abdrashitov, Muriel Médard:
Durable network coded distributed storage. 851-856 - Ebrahim MolavianJazi, Aylin Yener:
Subset source coding. 857-864 - Mehran Elyasi, Soheil Mohajer:
A probabilistic approach towards exact-repair regeneration codes. 865-872 - Minh Tuan Nguyen, Hung M. La, Keith A. Teague:
Compressive and collaborative mobile sensing for scalar field mapping in robotic networks. 873-880 - Jun Zhao:
The absence of isolated node in geometric random graphs. 881-886 - Jun Zhao:
On the resilience to node capture attacks of secure wireless sensor networks. 887-893 - Ron Yadgar, Asaf Cohen, Omer Gurewitz:
Scaling laws for reliable data dissemination in shared loss multicast trees. 894-900 - Pulkit Grover, Jeffrey A. Weldon, Shawn K. Kelly, Praveen Venkatesh, Haewon Jeong:
An information theoretic technique for harnessing attenuation of high spatial frequencies to design ultra-high-density EEG. 901-908 - Reza Shokri, Vitaly Shmatikov:
Privacy-preserving deep learning. 909-910 - Bahman Moraffah, Lalitha Sankar:
Information-theoretic private interactive mechanism. 911-918 - Vinay Praneeth Boda, Prakash Narayan:
Memoryless sampling rate distortion. 919-923 - Mark Braverman, Brendan Juba:
The price of uncertainty in communication. 924-927 - Yuval Kochman, Gregory W. Wornell:
Excess distortion in lossy compression: Beyond one-shot analysis. 928-934 - Maryam Hosseini, Narayana Santhanam:
Single letter characterization of average-case strong redundancy of compressing memoryless sequences. 935-940 - Ahmad Beirami, A. Robert Calderbank, Mark M. Christiansen, Ken R. Duffy, Ali Makhdoumi, Muriel Médard:
A geometric perspective on guesswork. 941-948 - Son Hoang Dau, Wentu Song, Alex Sprintson, Chau Yuen:
Constructions of MDS codes via random Vandermonde and Cauchy matrices over small fields. 949-955 - Swanand Kadhe, Emina Soljanin, Alex Sprintson:
When do the availability codes make the stored data more available? 956-963 - Songze Li, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Coded MapReduce. 964-971 - Anuran Makur, Fabian Kozynski, Shao-Lun Huang, Lizhong Zheng:
An efficient algorithm for information decomposition and extraction. 972-979 - Ibrahim Issa, Aaron B. Wagner:
Measuring secrecy by the probability of a successful guess. 980-987 - Rahul Kidambi, Sreeram Kannan:
On Shannon capacity and causal estimation. 988-992 - Chung Chan, Tie Liu:
Clustering by multivariate mutual information under Chow-Liu tree approximation. 993-999 - Gourav Saha, Ramkrishna Pasumarthy:
Maximizing profit of Cloud Brokers under Quantized Billing Cycles: a Dynamic pricing strategy based on ski-rental problem. 1000-1007 - Abhishek Gupta, Rahul Jain, Ram Rajagopal:
Scheduling, pricing, and efficiency of non-preemptive flexible loads under direct load control. 1008-1015 - Víctor Valls, Douglas J. Leith:
Dual subgradient methods using approximate multipliers. 1016-1021 - Chenguang Xi, Usman A. Khan:
Directed-Distributed Gradient Descent. 1022-1026 - Krishnamurthy Dvijotham:
Systems of quadratic equations: Efficient solution algorithms and conditions for solvability. 1027-1031 - Shahab Asoodeh, Fady Alajaji, Tamás Linder:
Lossless secure source coding: Yamamoto's setting. 1032-1037 - Chong Li, Nicola Elia:
Control approach to computing the feedback capacity for stationary finite dimensional Gaussian channels. 1038-1045 - Ramin Soltani, Dennis Goeckel, Don Towsley, Amir Houmansadr:
Covert communications on Poisson packet channels. 1046-1052 - Wenbo He, Bobak Nazer, Shlomo Shamai:
Dirty-paper integer-forcing. 1053-1060 - Pengwei Wang, Reihaneh Safavi-Naini, Fuchun Lin:
Erasure adversarial wiretap channels. 1061-1068 - Yining Wang, Aarti Singh:
An empirical comparison of sampling techniques for matrix column subset selection. 1069-1074 - Daniel L. Pimentel-Alarcón, Nigel Boston, Robert D. Nowak:
A characterization of deterministic sampling patterns for low-rank matrix completion. 1075-1082 - Alon Kipnis, Yonina C. Eldar, Andrea J. Goldsmith:
Optimal trade-off between sampling rate and quantization precision in A/D conversion. 1083-1090 - Yongxi Lu, Tara Javidi:
Efficient object detection for high resolution images. 1091-1098 - Jingjing Zhang, Felix Engelmann, Petros Elia:
Coded caching for reducing CSIT-feedback in wireless communications. 1099-1105 - Mengke Lian, Henry D. Pfister:
Belief-propagation reconstruction for compressed sensing: Quantization vs. Gaussian approximation. 1106-1113 - Gen Li, Yuantao Gu, Yue M. Lu:
Phase retrieval using iterative projections: Dynamics in the large systems limit. 1114-1118 - Sebastian Pokutta:
Information theory and polyhedral combinatorics. 1119-1126 - Victoria Kostina:
Data compression with low distortion and finite blocklength. 1127-1134 - Xiugang Wu, Ayfer Özgür:
Cut-set bound is loose for Gaussian relay networks. 1135-1142 - Kyu Seob Kim, Chih-Ping Li, Igor Kadota, Eytan H. Modiano:
Optimal scheduling of real-time traffic in wireless networks with delayed feedback. 1143-1149 - Parisa Hassanzadeh, Elza Erkip, Jaime Llorca, Antonia M. Tulino:
Distortion-memory tradeoffs in cache-aided wireless video delivery. 1150-1157 - Mingming Cai, J. Nicholas Laneman:
Database-aided distributed channel assignment in spectrum sharing. 1158-1165 - Fengming Cao, Ayalvadi Ganesh, Simon Armour, Mahesh Sooriyabandara:
On the distribution and mean of received power in stochastic cellular network. 1166-1173 - L. Srikar Muppirisetty, John Tadrous, Atilla Eryilmaz, Henk Wymeersch:
On proactive caching with demand and channel uncertainties. 1174-1181 - Jun Zhao:
Sharp transitions in random key graphs. 1182-1188 - Osman Yagan:
Absence of isolated nodes in inhomogeneous random key graphs. 1189-1196 - Ivo Kubjas, Vitaly Skachek:
Data dissemination problem in wireless networks. 1197-1204 - Yuki Takeda, Yuichi Kaji, Minoru Ito:
On the computational complexity of the solvability of information flow problem with hierarchy constraint. 1205-1210 - Ramina Ghods, Charles Jeon, Arian Maleki, Christoph Studer:
Optimal large-MIMO data detection with transmit impairments. 1211-1218 - Dionysios S. Kalogerias, Athina P. Petropulu:
On pathwise convergence of particle & grid based nonlinear filters: Feller vs conditional regularity. 1219-1226 - Mohammad Aghagolzadeh, Hayder Radha:
New guarantees for Blind Compressed Sensing. 1227-1234 - Hye Won Chung, Brian M. Sadler, Alfred O. Hero III:
Bounds on variance for symmetric unimodal distributions. 1235-1240 - John Lipor, Laura Balzano, Branko Kerkez, Donald Scavia:
Quantile search: A distance-penalized active learning algorithm for spatial sampling. 1241-1248 - Mostafa El Gamal, Lifeng Lai:
Are Slepian-Wolf rates necessary for distributed parameter estimation? 1249-1255 - Alireza Vahid, Ilan Shomorony, A. Robert Calderbank:
Informational bottlenecks in two-unicast wireless networks with delayed CSIT. 1256-1263 - Inaki Estella Aguerri, Abdellatif Zaidi:
Partial compute-compress-and-forward for limited backhaul uplink multicell processing. 1264-1271 - Ilai Bistritz, Amir Leshem:
Asymptotically optimal distributed channel allocation: A competitive game-theoretic approach. 1272-1279 - Mirza Uzair Baig, Anders Høst-Madsen:
Fundamental relationships between energy and delay in streaming. 1280-1285 - Hamed Pezeshki, J. Nicholas Laneman:
Anywhere decoding: Low-overhead basestation cooperation for interference- and fading-limited wireless environments. 1286-1293 - Sung Hoon Lim, Chen Feng, Bobak Nazer, Michael Gastpar:
A joint typicality approach to compute-forward. 1294-1301 - Mokshay M. Madiman, Ashwini Deo:
Extracting semantic information without linguistic cues from generic sentences. 1302-1307 - Varun S. Jog, Po-Ling Loh:
Recovering communities in weighted stochastic block models. 1308-1315 - Ena Hariyoshi, Gireeja Ranade, Anant Sahai:
Vector control systems with unpredictable actuation. 1316-1322 - Manjesh Kumar Hanawal, Venkatesh Saligrama:
Cost effective algorithms for spectral bandits. 1323-1329 - Sattar Vakili, Qing Zhao:
Mean-variance and value at risk in multi-armed bandit problems. 1330-1335 - Ali Mousavi, Ankit B. Patel, Richard G. Baraniuk:
A deep learning approach to structured signal recovery. 1336-1343 - Mina Karzand, Guy Bresler:
Inferning trees. 1344-1351 - Songbai Yan, Kamalika Chaudhuri, Tara Javidi:
Active learning from noisy and abstention feedback. 1352-1357 - Jun Zhao:
Threshold functions in random s-intersection graphs. 1358-1365 - Nagaraj Thenkarai Janakiraman, Santosh K. Emmadi, Krishna R. Narayanan, Kannan Ramchandran:
Exploring connections between Sparse Fourier Transform computation and decoding of product codes. 1366-1373 - Stefan Farthofer, Gerald Matz:
Linear superposition coding for the Gaussian MAC with quantized feedback. 1374-1379 - Remi A. Chou, Matthieu R. Bloch:
Using deterministic decisions for low-entropy bits in the encoding and decoding of polar codes. 1380-1385 - Bastien Pasdeloup, Michael G. Rabbat, Vincent Gripon, Dominique Pastor, Grégoire Mercier:
Graph reconstruction from the observation of diffused signals. 1386-1390 - Dorina Thanou, Pascal Frossard:
Distributed signal processing with graph spectral dictionaries. 1391-1398 - Eduardo Pavez, Nicolò Michelusi, Aamir Anis, Urbashi Mitra, Antonio Ortega:
Markov chain sparsification with independent sets for approximate value iteration. 1399-1405 - Santiago Segarra, Antonio G. Marques, Alejandro Ribeiro:
Distributed implementation of linear network operators using graph filters. 1406-1413 - Tianxi Ji, Siheng Chen, Rohan Varma, Jelena Kovacevic:
Energy-efficient route planning for autonomous aerial vehicles based on graph signal recovery. 1414-1421 - Anuran Makur, Lizhong Zheng:
Bounds between contraction coefficients. 1422-1429 - Mehrdad Kiamari, Amir Salman Avestimehr:
Are generalized cut-set bounds tight for the deterministic interference channel? 1430-1437 - Ali Haghi, Amir K. Khandani:
Achievable sum-rate of the two-user Gaussian interference channel through rate-splitting and successive decoding. 1438-1445 - Asma Ghorbel, Mari Kobayashi, Sheng Yang:
Cache-enabled broadcast packet erasure channels with state feedback. 1446-1453 - Mehdi Sharifzadeh, Dan Schonfeld:
Statistical and information-theoretic optimization and performance bounds of video steganography. 1454-1457 - Cengiz Pehlevan, Dmitri B. Chklovskii:
Optimization theory of Hebbian/anti-Hebbian networks for PCA and whitening. 1458-1465 - Alyson K. Fletcher:
Scalable inference of neural dynamical systems. 1466-1469 - Samir Chowdhury, Facundo Mémoli:
Metric structures on networks and applications. 1470-1472 - Yu Lu, Sahand N. Negahban:
Individualized rank aggregation using nuclear norm regularization. 1473-1479 - Ori Shmuel, Asaf Cohen, Omer Gurewitz:
Performance analysis for multi-user systems under distributed opportunistic scheduling. 1480-1485 - Ali Haghi, Neda Mohammadizadeh, Amir K. Khandani:
Delay in cooperative communications: Higher multiplexing gain in Gaussian interference channels with full-duplex transmitters. 1486-1493 - Armand M. Makowski, Osman Yagan:
On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodes. 1494-1501 - Selma Belhadj Amor, Michèle A. Wigger:
Linear-feedback MAC-BC duality for correlated BC-noises, and iterative coding. 1502-1509 - Kuo-Lun Huang, Vincent C. Gaudet, Masoud Salehi:
A low-latency algorithm for stochastic decoding of LDPC codes. 1510-1515 - Naim Bajçinca, Elham Almodaresi, Minfeng Ruan:
A hybrid Petri net formalism and resource allocation in distributed control systems. 1516-1524
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 2026-01-27 23:57 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:
