[1]   Jayant Apte and John MacLaren Walsh, “Explicit Polyhedral Bounds on Network Coding Rate Regions via Entropy Function Region: Algorithms, Symmetry, and Computation,” IEEE Trans. Inform. Theory, submitted on July 22, 2016. [Online]. Available: https://arxiv.org/abs/1607.06833

[2]   Jayant Apte, “Algorithms for computing limits on information flow and storage in networks,” Ph.D. dissertation, Drexel University, Philadelphia, PA, 2016. [Online]. Available: http://www.ece.drexel.edu/walsh/JayantApte_thesis.pdf

[3]   Jayant Apte and John MacLaren Walsh, “Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding,” IEEE Trans. Inform. Theory, submitted on May 15, 2016. [Online]. Available: http://arxiv.org/abs/1605.04598

[4]   Congduan Li, Steven Weber, and John MacLaren Walsh, “On Multi-source Networks: Enumeration, Rate Region Computation, and Hierarchy,” IEEE Trans. Inform. Theory, submitted on July 21, 2015. [Online]. Available: http://arxiv.org/abs/1507.05728

[5]   ——, “On Multilevel Diversity Coding Systems,” IEEE Trans. Inform. Theory, submitted on July 21, 2014. Reviews received January 6, 2016. [Online]. Available: http://arxiv.org/abs/1407.5659

[6]   Congduan Li, Steven Weber, John MacLaren Walsh, “Network combination operations preserving the sufficiency of linear network codes,” in IEEE Information Theory Workshop, Oct. 2015. [Online]. Available: http://www.ece.drexel.edu/walsh/Li_ITW_2015.pdf

[7]   Congduan Li, “On Multi-source Multi-Sink Hyperedge Networks: Enumeration, Rate Region Computation, and Hierarchy,” Ph.D. dissertation, Drexel University, Philadelphia, PA, 2015. [Online]. Available: http://www.ece.drexel.edu/walsh/CongduanLi_Thesis.pdf

[8]   Congduan Li, Steven Weber, John MacLaren Walsh, “Computer Aided Proofs for Rate Regions of Independent Distributed Source Coding Problems,” in International Symposium on Network Coding (NetCod 2015), Jun. 2015. [Online]. Available: http://www.ece.drexel.edu/walsh/Congduan_NetCod2015.pdf

[9]   Jayant Apte and John MacLaren Walsh, “Exploiting Symmetry in Computing Polyhedral Bounds on Network Coding Rate Regions,” in International Symposium on Network Coding (NetCod 2015), Jun. 2015. [Online]. Available: http://www.ece.drexel.edu/walsh/Jayant_NetCod15.pdf

[10]   ——, “Symmetry in Network Coding: formalization, graph-theoretic characterization, and computation,” in IEEE International Symposium on Information Theory (ISIT 2015), Jun. 2015. [Online]. Available: http://www.ece.drexel.edu/walsh/Apte_ISIT_2015.pdf

[11]   Jayant Apte, Congduan Li, and John MacLaren Walsh, “Algorithms for Computing Network Coding Rate Regions via Single Element Extensions of Matroids,” in IEEE International Symposium on Information Theory (ISIT 2014), Jul. 2014, pp. 2306–2310. [Online]. Available: http://www.ece.drexel.edu/walsh/Apte_ISIT_2014.pdf

[12]   Congduan Li, John MacLaren Walsh, Steven Weber, “Matroid bounds on the region of entropic vectors,” in 51th Annual Allerton Conference on Communication, Control and Computing, Oct. 2013. [Online]. Available: http://www.ece.drexel.edu/walsh/Congduan_allerton13.pdf

[13]   Congduan Li, Jayant Apte, John MacLaren Walsh, Steven Weber, “A new computational approach for determining rate regions and optimal codes for coded networks,” in The 2013 IEEE International Symposium on Network Coding (NetCod 2013), Jun. 2013. [Online]. Available: http://www.ece.drexel.edu/walsh/LiNetCod13.pdf

[14]   Congduan Li, John MacLaren Walsh, Steven Weber, “A computational approach for determining rate regions and codes using entropic vector bounds,” in 50th Annual Allerton Conference on Communication, Control and Computing, Oct. 2012. [Online]. Available: http://www.ece.drexel.edu/walsh/Allerton2012LJW.pdf

[15]   Steven Weber, Congduan Li, John MacLaren Walsh, “Rate Region for A Class of Delay Mitigating Codes and P2P Networks,” in 46th Annual Conference on Information Sciences and Systems, Mar. 2012. [Online]. Available: http://dx.doi.org/10.1109/CISS.2012.6310926

[16]   J. M. Walsh, S. P. Weber, J. C. de Oliveira, A. Eryilmaz, M. Médard, “Trading Rate for Delay at the Application and Transport Layers (Guest Editorial),” IEEE J. Select. Areas Commun., vol. 29, no. 5, pp. 913–915, May 2011. [Online]. Available: http://dx.doi.org/10.1109/JSAC.2011.110501

[17]   J. M. Walsh, S. Weber, and C. wa Maina, “Optimal Rate Delay Tradeoffs and Delay Mitigating Codes for Multipath Routed and Network Coded Networks,” IEEE Trans. Inform. Theory, vol. 55, no. 12, pp. 5491–5510, Dec. 2009. [Online]. Available: http://dx.doi.org/10.1109/TIT.2009.2032851

[18]   J. M. Walsh and S. Weber, “Capacity Region of the Permutation Channel,” in 46th Annual Allerton Conference on Communication, Control, and Computing, Sep. 2008. [Online]. Available: http://www.ece.drexel.edu/walsh/walshAllerton08.pdf

[19]   John MacLaren Walsh and Steven Weber, “Fundamental Rate Delay Tradeoffs in Multipath Routed and Network Coded Networks,” Sep. 2008, DARPA ITMANET Meeting, Arlington, VA. [Online]. Available: http://www.ece.drexel.edu/walsh/weberITMANET0908.pdf

[20]   ——, “ Capacity Region of the Permutation Channel ,” Sep. 2008, DARPA ITMANET Meeting, Arlington, VA. [Online]. Available: http://www.ece.drexel.edu/walsh/weberITMANET0908poster.pdf

[21]   J. M. Walsh, S. Weber, and C. Maina, “Optimal Rate Delay Tradeoffs for Multipath Routed and Network Coded Networks,” in IEEE International Symposium on Information Theory (ISIT), Jul. 2008, pp. 682 – 686. [Online]. Available: http://www.ece.drexel.edu/walsh/WalshIsit08.pdf

[22]   John MacLaren Walsh and Steven Weber, “Fundamental Rate Delay Tradeoffs in Multipath Routed and Network Coded Networks,” Apr. 2008, MIT Workshop on Geometric Approaches in Communications and Signal Processing. [Online]. Available: http://www.ece.drexel.edu/walsh/weberMITW08.pdf

[23]   J. M. Walsh and S. Weber, “A Concatenated Network Coding Scheme for Multimedia Transmission,” in Fourth Workshop on Network Coding, Theory, and Applications (Netcod 2008), Jan. 2008, pp. 91–96. [Online]. Available: http://www.ece.drexel.edu/walsh/netcod08.pdf

[24]   ——, “Coding to reduce delay on a permutation channel,” in 45th Allerton Conference on Communication, Control, and Computing, Sep. 2007. [Online]. Available: http://www.ece.drexel.edu/walsh/allerton07.pdf

[1]   Jayant Apte and John MacLaren Walsh, “Explicit Polyhedral Bounds on Network Coding Rate Regions via Entropy Function Region: Algorithms, Symmetry, and Computation,” IEEE Trans. Inform. Theory, submitted on July 22, 2016. [Online]. Available: https://arxiv.org/abs/1607.06833

[2]   Jayant Apte, Qi Chen, and John MacLaren Walsh, “Symmetries in Entropy Space,” in 2016 IEEE Information Theory Workshop (ITW), Sep. 2016, accepted. to appear.

[3]   Jayant Apte, “Algorithms for computing limits on information flow and storage in networks,” Ph.D. dissertation, Drexel University, Philadelphia, PA, 2016. [Online]. Available: http://www.ece.drexel.edu/walsh/JayantApte_thesis.pdf

[4]   Yunshu Liu, “Extremal Entropy: Information Geometry, Numerical Entropy Mapping, and Machine Learning Application of Associated Conditional Independences,” Ph.D. dissertation, Drexel University, Philadelphia, PA, 2016. [Online]. Available: http://www.ece.drexel.edu/walsh/YunshuLiu_thesis.pdf

[5]   Jayant Apte and John MacLaren Walsh, “Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding,” IEEE Trans. Inform. Theory, submitted on May 15, 2016. [Online]. Available: http://arxiv.org/abs/1605.04598

[6]   Yunshu Liu and John MacLaren Walsh, “Mapping the Region of Entropic Vectors with Support Enumeration & Information Geometry,” IEEE Trans. Inform. Theory, submitted on December 08, 2015. [Online]. Available: http://arxiv.org/abs/1512.03324

[7]   Congduan Li, Steven Weber, and John MacLaren Walsh, “On Multi-source Networks: Enumeration, Rate Region Computation, and Hierarchy,” IEEE Trans. Inform. Theory, submitted on July 21, 2015. [Online]. Available: http://arxiv.org/abs/1507.05728

[8]   ——, “On Multilevel Diversity Coding Systems,” IEEE Trans. Inform. Theory, submitted on July 21, 2014. Reviews received January 6, 2016. [Online]. Available: http://arxiv.org/abs/1407.5659

[9]   Yunshu Liu and John MacLaren Walsh, “Non-isomorphic Distribution Supports for Calculating Entropic Vectors,” in 53nd Annual Allerton Conference on Communication, Control, and Computing, Oct. 2015. [Online]. Available: http://www.ece.drexel.edu/walsh/Liu_Allerton_2015.pdf

[10]   Congduan Li, “On Multi-source Multi-Sink Hyperedge Networks: Enumeration, Rate Region Computation, and Hierarchy,” Ph.D. dissertation, Drexel University, Philadelphia, PA, 2015. [Online]. Available: http://www.ece.drexel.edu/walsh/CongduanLi_Thesis.pdf

[11]   Congduan Li, Steven Weber, John MacLaren Walsh, “Network Embedding Operations Preserving the Insufficiency of Linear Network Codes,” in 52nd Annual Allerton Conference on Communication, Control, and Computing, Oct. 2014. [Online]. Available: http://www.ece.drexel.edu/walsh/Li_Allerton_2014.pdf

[12]   Jayant Apte, Congduan Li, and John MacLaren Walsh, “Algorithms for Computing Network Coding Rate Regions via Single Element Extensions of Matroids,” in IEEE International Symposium on Information Theory (ISIT 2014), Jul. 2014, pp. 2306–2310. [Online]. Available: http://www.ece.drexel.edu/walsh/Apte_ISIT_2014.pdf

[13]   Jayant Apte, Congduan Li, John MacLaren Walsh and Steven Weber, “Exact repair problems with multiple sources,” in The 48th annual IEEE Conference on Information Sciences and Systems(CISS), Mar. 2014. [Online]. Available: http://www.ece.drexel.edu/walsh/Jayant_cisspaper.pdf

[14]   John MacLaren Walsh, “Calculating rate regions for network coding and distributed storage via polyhedral projection and representable matroid enumeration,” Feb. 2014, 2014 Information Theory and Applications Workshop, University of California San Diego. [Online]. Available: http://www.ece.drexel.edu/walsh/WalshITA14.pdf

[15]   Yunshu Liu, John MacLaren Walsh, “Bounding the entropic region via information geometry,” in IEEE Information Theory Workshop, Sep. 2013. [Online]. Available: http://www.ece.drexel.edu/walsh/ITW2013_Liu.pdf

[16]   Congduan Li, John MacLaren Walsh, Steven Weber, “Matroid bounds on the region of entropic vectors,” in 51th Annual Allerton Conference on Communication, Control and Computing, Oct. 2013. [Online]. Available: http://www.ece.drexel.edu/walsh/Congduan_allerton13.pdf

[17]   Congduan Li, Jayant Apte, John MacLaren Walsh, Steven Weber, “A new computational approach for determining rate regions and optimal codes for coded networks,” in The 2013 IEEE International Symposium on Network Coding (NetCod 2013), Jun. 2013. [Online]. Available: http://www.ece.drexel.edu/walsh/LiNetCod13.pdf

[18]   John MacLaren Walsh, “Information Geometry, Polyhedral Computation, and Entropic Vectors,” in First Workshop on Entropy and Information Inequalities, The Chinese University of Hong Kong, Apr. 2013. [Online]. Available: http://www.youtube.com/watch?v=gYkS73jyvPU&feature=youtu.be

[19]   ——, “Entropic Vectors: Polyhedral Computation and Information Geometry,” Feb. 2013, 2013 Information Theory and Applications Workshop, University of California San Diego. [Online]. Available: http://www.ece.drexel.edu/walsh/WalshITA13.pdf

[20]   Congduan Li, John MacLaren Walsh, Steven Weber, “A computational approach for determining rate regions and codes using entropic vector bounds,” in 50th Annual Allerton Conference on Communication, Control and Computing, Oct. 2012. [Online]. Available: http://www.ece.drexel.edu/walsh/Allerton2012LJW.pdf

[21]   John MacLaren Walsh, “Characterizing the Region of Entropic Vectors via Information Geometry,” Feb. 2012, 2012 Information Theory and Applications Workshop (ITA). [Online]. Available: http://www.ece.drexel.edu/walsh/walshITA12.pdf

[22]   J. M. Walsh and S. Weber, “A Recursive Construction of the Set of Binary Entropy Vectors and Related Inner Bounds for the Entropy Region,” IEEE Trans. Inform. Theory, vol. 57, no. 10, pp. 6356–6363, Oct. 2011. [Online]. Available: http://dx.doi.org/10.1109/TIT.2011.2165817

[23]   John MacLaren Walsh and Steven Weber, “Relationships Among Bounds for the Region of Entropic Vectors in Four Variables,” in 2010 Allerton Conference on Communication, Control, and Computing, Sep. 2010. [Online]. Available: http://www.ece.drexel.edu/walsh/allerton10.pdf

[24]   ——, “Tunable Inner Bounds for the Region of Entropy Vectors,” Feb. 2010, 2010 Information Theory and Applications Workshop, University of California San Diego. [Online]. Available: http://www.ece.drexel.edu/walsh/walshITA10.pdf

[25]   ——, “A Recursive Construction of the Set of Binary Entropy Vectors,” in Forty-Seventh Annual Allerton Conference on Communication, Control, and Computing, Sep. 2009, pp. 545–552. [Online]. Available: http://www.ece.drexel.edu/walsh/binEntSetConf-v5-JW.pdf

[26]   ——, “An Inner Bound Technique on the Normalized Set of Entropy Vectors,” Sep. 2009, DARPA ITMANET Meeting, MIT. [Online]. Available: http://www.ece.drexel.edu/walsh/weberITMANET0909.pdf

[27]   ——, “Properties of the Binary Entropy Vector Region,” Mar. 2009, DARPA ITMANET Meeting, Stanford University. [Online]. Available: http://www.ece.drexel.edu/walsh/weberITMANET0309.pdf

[28]   John MacLaren Walsh, Steven Weber, Drakontas LLC, “Optimal Coded Information Network Design and Management via Improved Characterizations of the Binary Entropy Function,” Feb. 2009, Air Force Office of Scientific Research Complex Network Program Review. [Online]. Available: http://www.ece.drexel.edu/walsh/walshAFOSR09.pdf

[1]   Solmaz Torabi and John MacLaren Walsh, “Distributed Lossy Interactive Function Computation,” in 54th Annual Allerton Conference on Communication, Control, and Computing, Sep. 2016. [Online]. Available: http://www.ece.drexel.edu/walsh/TorabiAllerton16.pdf

[2]   Jie Ren, “Control Overhead Optimization in Wireless Resource Allocation Problems,” Ph.D. dissertation, Drexel University, Philadelphia, PA, 2016. [Online]. Available: http://www.ece.drexel.edu/walsh/JieRen_Thesis.pdf

[3]   Solmaz Torabi, Jie Ren and John MacLaren Walsh, “Practical Interactive Scheme for Extremum Computation in Distributed Networks,” in IEEE International Symposium on Information Theory (ISIT 2016), Jul. 2016. [Online]. Available: http://www.ece.drexel.edu/walsh/Solmaz_isit_2016.pdf

[4]   Solmaz Torabi and John MacLaren Walsh, “Interactive Quantization for Extremum Computation in Collocated Networks,” in Data Compression Conference (DCC 2016), Apr. 2016.

[5]   J. Ren, B. Boyle, G. Ku, S. Weber, and J. M. Walsh, “Overhead performance tradeoffs - a resource allocation perspective,” IEEE Trans. Inform. Theory, vol. 62, no. 6, pp. 3243–3269, June 2016. [Online]. Available: http://dx.doi.org/10.1109/TIT.2016.2524576

[6]   Gwanmo Ku, “Efficient Control Signaling for Resource Allocation in OFDMA Networks,” Ph.D. dissertation, Drexel University, Philadelphia, PA, 2014. [Online]. Available: http://www.ece.drexel.edu/walsh/Ku_PhD.pdf

[7]   Gwanmo Ku, Jie Ren, and John MacLaren Walsh, “Computing the Rate Distortion Region for the CEO Problem with Independent Sources,” IEEE Trans. Signal Processing, vol. 63, no. 3, pp. 567–575, Feb. 2015. [Online]. Available: http://dx.doi.org/10.1109/TSP.2014.2379631

[8]   Jie Ren and John M. Walsh, “Interactive communication for resource allocation,” in The 48th annual IEEE Conference on Information Sciences and Systems(CISS), Mar. 2014. [Online]. Available: http://www.ece.drexel.edu/walsh/JR_ciss2014.pdf

[9]   Bradford D. Boyle, John MacLaren Walsh and Steven Weber, “Distributed scalar quantizers for sub-band allocation,” in The 48th annual IEEE Conference on Information Sciences and Systems(CISS), Mar. 2014. [Online]. Available: http://www.ece.drexel.edu/walsh/Boyle-CISS-2014.pdf

[10]   John MacLaren Walsh, S. Weber, L. Cimini, J. Garcia-Frias, “Overhead Performance Tradeoffs in Distributed Wireless Networks,” Dec. 2012, AFOSR Complex Networks Program Review. [Online]. Available: http://www.ece.drexel.edu/walsh/cnReview-Dec12.pdf

[11]   Sivagnanasundaram Ramanan, “Collaborative Estimation in Networks,” Ph.D. dissertation, Drexel University, Philadelphia, PA, 2011. [Online]. Available: http://www.ece.drexel.edu/walsh/Ramanan_PhD.pdf

[12]   S. Ramanan and J. M. Walsh, “Practical Codes for Collaborative Estimation,” IEEE Trans. Signal Processing, vol. 60, no. 6, pp. 3203–3216, Jun. 2012. [Online]. Available: http://dx.doi.org/10.1109/TSP.2012.2189765

[13]   Sivagnanasundaram Ramanan and John MacLaren Walsh, “Practical Codes for Lossy Compression when Side Information May be Absent,” in IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2011), May 2011. [Online]. Available: http://www.ece.drexel.edu/walsh/Ramanan_ICASSP_05_11.pdf

[14]   John MacLaren Walsh and Sivagnanasundaram Ramanan, “Fundamental Limits and Practical Codes for Collaborative Estimation,” Feb. 2011, 2011 Information Theory and Applications Workshop (ITA), University of California San Diego. [Online]. Available: http://www.ece.drexel.edu/walsh/walshITA11.pdf

[15]   Leonard J. Cimini, John MacLaren Walsh, and Steven Weber, “Energy Efficient Distributed Wireless Resource Allocation,” Nov. 2010, Air Force Office of Scientific Research Complex Network Program Review. [Online]. Available: http://www.ece.drexel.edu/walsh/ciminiAFOSR10.pdf

[16]   Sivagnanasundaram Ramanan and John MacLaren Walsh, “Coding Perspectives for Collaborative Distributed Estimation Over Networks,” in 2010 Asilomar Conference on Signals, Systems, and Computers, Nov. 2010. [Online]. Available: http://www.ece.drexel.edu/walsh/Ramanan_Asilomar10.pdf

[17]   John MacLaren Walsh and Sivagnanasundaram Ramanan, “Perspectives for Collaborative Estimation over Networks,” Jul. 2010, Presentation to McGill University ECE Dept. [Online]. Available: http://www.ece.drexel.edu/walsh/walshMcGill10.pdf

[18]   S. Ramanan and J. M. Walsh, “Distributed Estimation of Channel Gains in Wireless Sensor Networks,” IEEE Trans. Signal Processing, vol. 58, no. 6, pp. 3097–3107, Jun. 2010. [Online]. Available: http://dx.doi.org/10.1109/TSP.2010.2044840

[19]   John MacLaren Walsh and Sivagnanasundaram Ramanan, “Perspectives for Collaborative Estimation over Networks,” Nov. 2009, Presentation to University of Delaware ECE Dept. [Online]. Available: http://www.ece.drexel.edu/walsh/walshDelaware09.pdf

[20]   S. Ramanan and J. M. Walsh, “Distributed Estimation of Channel Gains in Wireless Sensor Networks,” in Forty-Second Asilomar Conference on Signals, Systems, and Computers, Oct. 2008. [Online]. Available: http://www.ece.drexel.edu/walsh/Ramanan_Asilomar_08.pdf

[21]   J. M. Walsh, P. A. Regalia, and S. Ramanan, “Optimality of Expectation Propagation Based Distributed Estimation for Wireless Sensor Network Initialization,” in 9th IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Jul. 2008, pp. 620 – 624. [Online]. Available: http://www.ece.drexel.edu/walsh/WalshSpawc08.pdf

[22]   J. M. Walsh and P. A. Regalia, “Belief propagation distributed estimation in sensor networks: An optimized energy accuracy tradeoff,” in IEEE International Conference on Acoustics, Speech, and Signal Processing, Apr. 2008, pp. 2297 – 2300. [Online]. Available: http://www.ece.drexel.edu/walsh/sensNetEst.pdf

[23]   ——, “Expectation propagation for distributed estimation in sensor networks,” in 8th IEEE International Workshop on Signal Processing Advances for Wireless Communications (SPAWC), Helsinki, Finland, Jun. 2007. [Online]. Available: http://www.ece.drexel.edu/walsh/spawc07.pdf

[1]   Ciira wa Maina, “Approximate Bayesian Inference for Robust Speech Processing,” Ph.D. dissertation, Drexel University, Philadelphia, PA, 2011. [Online]. Available: http://www.ece.drexel.edu/walsh/Maina_PhD.pdf

[2]   C. Maina and J. M. Walsh, “Log Spectra Enhancement using Speaker Dependent Priors for Speaker Verification,” submitted March 14, 2011. Revised July 15, 2011. 2nd Review received September, 2011. Undergoing further revision.

[3]   Ciira wa Maina and John MacLaren Walsh, “Log Spectra Enhancement using Speaker Dependent Priors for Speaker Verification,” in IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2011), May 2011. [Online]. Available: http://www.ece.drexel.edu/walsh/Maina_ICASSP_05_11.pdf

[4]   ——, “Approximate Bayesian Robust Speech Processing,” in 45th Annual Asilomar Conference of Signals, Systems, and Computers, Nov. 2011. [Online]. Available: http://www.ece.drexel.edu/walsh/Maina_Asilomar_11.pdf

[5]   ——, “Compensating for Noise and Mismatch in Speaker Verification Systems Using Approximate Bayesian Inference,” in 45th Conference on Information Sciences and Systems CISS 2011, Mar. 2011. [Online]. Available: http://dx.doi.org/10.1109/CISS.2011.5766174

[6]   C. W. Maina and J. M. Walsh, “Joint speech enhancement and speaker identification using approximate bayesian inference,” Audio, Speech, and Language Processing, IEEE Transactions on, vol. 19, no. 6, pp. 1517–1529, 2011. [Online]. Available: http://dx.doi.org/10.1109/TASL.2010.2092767

[7]   Ciira wa Maina and John MacLaren Walsh, “Joint Speech Enhancement and Speaker Identification Using Approximate Bayesian Inference,” in 44th Annual Conference on Information Sciences and Systems, Mar. 2010. [Online]. Available: http://www.ece.drexel.edu/walsh/Maina_CISS_10.pdf

[8]   ——, “Robust Speaker Recognition Using Approximate Bayesian Inference,” Dec. 2009, Demonstration at Neural Information Processing Symposium (NIPS) 2009.

[9]   ——, “Joint Speech Enhancement and Speaker Identification Using Monte Carlo Methods,” in Interspeech 2009, Sep. 2009. [Online]. Available: http://www.ece.drexel.edu/walsh/Maina_Interspeech_09.pdf

[10]   Y. E. Kim, J. M. Walsh, and T. M. Doll, “Comparison of a Joint Iterative Method for Multiple Speaker Identification with Sequential Blind Source Separation and Speaker Identification,” in Odyssey 2008: The Speaker and Language Recognition Workshop, Jan. 2008. [Online]. Available: http://www.ece.drexel.edu/walsh/Odyssey2008.pdf

[11]   J. M. Walsh, Y. E. Kim, and T. M. Doll, “Joint iterative multi-speaker identification and source separation using expectation propagation,” in IEEE Workshop on Applications of Signal Processing to Audio and Acoustics, Oct. 2007, pp. 283 – 286. [Online]. Available: http://www.ece.drexel.edu/walsh/waspaa07.pdf

[1]   J. M. Walsh and P. A. Regalia, “Belief Propagation, Dykstra’s Algorithm, and Iterated Information Projections,” IEEE Trans. Inform. Theory, vol. 56, no. 8, pp. 4114–4128, Aug. 2010. [Online]. Available: http://dx.doi.org/10.1109/TIT.2010.2050833

[2]   Phil Regalia and John MacLaren Walsh, “Information Projection Algorithms and Belief Propagation,” Jun. 2008, P. Dewilde Workshop, Wassenaar. [Online]. Available: http://www.ece.drexel.edu/walsh/regalia-wassenaar-talk.pdf

[3]   John MacLaren Walsh, “Belief Propagation, Information Projections, and Dykstra’s Algorithm,” Apr. 2008, MIT Workshop on Geometric Approaches in Communications and Signal Processing. [Online]. Available: http://www.ece.drexel.edu/walsh/walshMITW08.pdf

[4]   P. A. Regalia and J. M. Walsh, “Optimality and Duality Aspects of the Turbo Decoder,” Proc. IEEE, vol. 95, no. 6, pp. 1362–1377, Jun. 2007. [Online]. Available: http://dx.doi.org/10.1109/JPROC.2007.896495

[5]   J. M. Walsh and P. A. Regalia, “On the relationship between belief propagation decoding and joint maximum likelihood detection,” IEEE Trans. Commun., vol. 58, no. 10, pp. 2753–2758, Oct. 2010. [Online]. Available: http://dx.doi.org/10.1109/TCOMM.2010.082010.080138

[6]   J. M. Walsh, P. A. Regalia, and C. R. Johnson, Jr., “Turbo Decoding as Iterative Constrained Maximum-Likelihood Sequence Detection,” IEEE Trans. Inform. Theory, vol. 52, no. 12, pp. 5426–5437, Dec. 2006. [Online]. Available: http://dx.doi.org/10.1109/TIT.2006.885535

[7]   J. M. Walsh, “A completed information projection interpretation of expectation propagation,” in Neural Information Processing Systems Workshop on Approximate Bayesian Inference in Continuous/Hybrid Systems, 2007. [Online]. Available: http://www.ece.drexel.edu/walsh/epInfProjNips07.pdf

[8]   ——, “EXIT and Density Evolution Analysis for Homogeneous Expectation Propagation,” in IEEE International Symposium on Information Theory, Nice, France, Jul. 2007, pp. 876–880. [Online]. Available: http://www.ece.drexel.edu/walsh/isit07.pdf

[9]   ——, “Density evolution for expectation propagation,” in International Conference on Acoustics, Speech, and Signal Processing (ICASSP), vol. 2, Honolulu, Hawaii, Apr. 2007, pp. II–545 – II–548. [Online]. Available: http://www.ece.drexel.edu/walsh/icassp07.pdf

[10]   ——, “Dual optimality frameworks for expectation propagation,” in Proc. Seventh IEEE Int. Conf. on Sig. Proc. Adv. in Wireless Comm. (SPAWC), Jul. 2006. [Online]. Available: http://www.ece.drexel.edu/walsh/spawc06.pdf

[1]   Mengke Hu, David Cinciruk and John MacLaren Walsh, “Improving Automated Patent Claim Parsing: Dataset, System, and Experiments,” Computational Linguistics, submitted on May 05, 2016. [Online]. Available: http://arxiv.org/abs/1605.01744

[2]   Nan Xie, John MacLaren Walsh, Steven Weber, “Properties of an Aloha-like stability region,” IEEE Trans. Inform. Theory, submitted on August 15, 2014. Reviews received June 22,2015.Revised September 21, 2015. [Online]. Available: http://arxiv.org/abs/1408.3469

[3]   Bradford D. Boyle, Jie Ren, John MacLaren Walsh and Steven Weber, “Interactive Scalar Quantization for Distributed Extremization,” IEEE Trans. Signal Processing, vol. 64, no. 5, pp. 1243–1256, Mar. 2016. [Online]. Available: http://dx.doi.org/10.1109/TSP.2015.2483479

[4]   Gwanmo Ku and John MacLaren Walsh, “Resource Allocation and Link Adaptation in LTE & LTE Advanced: A Tutorial,” IEEE Communications Surveys and Tutorials, vol. 17, no. 3, pp. 1605–1633. [Online]. Available: http://dx.doi.org/10.1109/COMST.2014.2383691

[5]   Bradford D. Boyle, John MacLaren Walsh, Steven Weber, “Channel dependent adaptive modulation and coding without channel state information at the transmitter,” in 38th International Conference on Acoustics, Speech, and Signal Processing (ICASSP), May 2013. [Online]. Available: http://www.ece.drexel.edu/walsh/BradICASSP13.pdf

[6]   Gwanmo Ku and John MacLaren Walsh, “Power Amplifier Nonlinearity Effects on OFDM Subcarrier Transmit Beamforming,” in IEEE Wireless Communications and Networking Conference (WCNC), Mar. 2011. [Online]. Available: http://dx.doi.org/10.1109/WCNC.2011.5779458

[7]   C. wa Maina and J. M. Walsh, “A Cost Function Level Analysis of Autocorrelation Minimization Based Blind Adaptive Channel Shorteners,” in Forty-Second Asilomar Conference on Signals, Systems, and Computers, Oct. 2008, Invited Paper. [Online]. Available: http://www.ece.drexel.edu/walsh/Maina_Asilomar_08.pdf

[8]   J. M. Walsh, R. K. Martin, and C. R. Johnson, Jr., “Convergence and Performance Issues for Autocorrelation Based Adaptive Channel Shortening,” in Fortieth Asilomar Conference on Signals, Systems, and Computers, Nov. 2006, pp. 238–242, Invited Paper. [Online]. Available: http://www.ece.drexel.edu/walsh/samConvPerf.pdf