SUNMONTUEWEDTHUFRISAT
Conferences, Lectures, & Seminars
Events for August
-
Magnetic Particle Imaging as a Deep-Penetrating, Quantitative, Positive-Contrast, & Noninvasive Imaging Method with Micromolar Sensitivity
Thu, Aug 17, 2017 @ 10:00 AM - 11:00 AM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Professor Steven Conolly, UC Berkeley Bioengineering & EECS
Talk Title: Magnetic Particle Imaging as a Deep-Penetrating, Quantitative, Positive-Contrast, & Noninvasive Imaging Method with Micromolar Sensitivity
Series: Medical Imaging Seminar Series
Abstract:
Host: Professor Krishna Nayak
Location: 248
Audiences: Everyone Is Invited
Contact: Talyia White
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor. -
Synchronization and Localization in Wireless Networks
Thu, Aug 17, 2017 @ 02:00 PM - 03:00 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Bernhard Etzlinger, Johannes Kepler University and Linz Austria
Talk Title: Synchronization and Localization in Wireless Networks
Abstract: Several widely-used radio localization systems, such as GPS and cellular localization, rely on time-of-flight measurements of data-bearing signals to determine inter-radio distances. For such measurements to be meaningful, accurate synchronization is required. Synchronization becomes more important in emerging applications for large cooperative wireless networks, and has led to active research in the area of synchronization and localization. State-of-the-art solutions either adopt a two-step, first synchronize then localize paradigm, or perform centralized, simultaneous localization and synchronization that impose stringent constraints on the network topology. In this talk, we introduce a framework for distributed simultaneous localization and synchronization that overcomes these limitations. The framework consists of a Bayesian factor graph formulation for cooperative simultaneous localization and synchronization, and is suited for wireless networks with mobile nodes and time-varying clock parameters. Building on this factor graph, a distributed belief propagation algorithm is developed that allows for real-time operation and is suitable for a time-varying network connectivity. While numerical results indicate a similar localization accuracy as achieved in perfectly synchronized networks, demonstrator implementations validate the robustness of the algorithm in practice.
Biography: Bernhard Etzlinger received the Dipl.-Ing. (M.Sc.) degree in mechatronics in 2010 and his Dr.techn. (Ph.D.) degree in technical sciences in 2016, both with distinction from the Johannes Kepler University Linz, Linz, Austria. Since 2016, he has been with the Institute of Communication Systems and RF-Systems, Johannes Kepler University Linz, where he is currently a postdoctoral researcher. In 2010, he worked at Fraunhofer FKIE, Wachtberg, Germany. During his Ph.D. studies, he was a visiting student with the Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden, and with the Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX, USA. Currently he is visiting scholar at the Ming Hsieh Department of Electrical Engineering, University of Southern California. Dr. Etzlinger is the recipient of the 2017 Upper-Austrian innovation prize for achievements on a secure communication interface for real-time power-line protection. He has also served as a TPC member for the 2017 VTC Spring Conference and as a session chair at the Asilomar Conference in 2015. Dr. Etzlinger's research interests include statistical signal processing for receiver design, cooperative network clock synchronization and localization, and wireless control systems.
Host: Urbashi Mitra, ubli@usc.edu, EEB 536, x04667
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 539
Audiences: Everyone Is Invited
Contact: Gerrielyn Ramos
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor. -
Model-based and data-based flow analysis using optimization
Mon, Aug 21, 2017 @ 02:00 PM - 03:00 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Peter Schmid, Imperial College, London
Talk Title: Model-based and data-based flow analysis using optimization
Series: Fall 2017 Joint CSC@USC/CommNetS-MHI Seminar Series
Abstract: In recent years, PDE-constrained optimization has become an effective and efficient tool in the analysis of complex fluid systems. Inherent stability, receptivity to external or internal forcing, or sensitivity to uncertainties or imperfections of fluid systems can be treated within this approach. We will present a computational framework based on this concept and demonstrate its ability to extract relevant information from numerical simulations, with examples from aeroacoustics, inertial mixing, roughness-induced receptivity, and turbomachinery cascades.
We will also discuss the reformulation of the PDE-constrained into a data-constrained framework and show preliminary steps in the analysis of fluid systems based on data only. We will present work in progress on phase-space clustering, data assimilation, and dynamic observers to detect and describe relevant mechanisms and coherent structures in data sequences.
Biography: Peter Schmid holds a Chair Professorship of Applied Mathematics and Mathematical Physics in the Department of Mathematics at Imperial College, London. Before joining the department in 2013, he held a position of research director (DR2) with the French National Research Agency (CNRS) and a professorship (PCC) at the Ecole Polytechnique in France, from 2005 to 2014. Before then, he was a faculty member in Applied Mathematics at the University of Washington in Seattle, WA (from 1993 to 2005).
Professor Schmid is a Fellow of the American Physical Society and a member of the editorial board of the Physical Review Fluids. He received his PhD in Mathematics in 1993 from the Massachusetts Institute of Technology and his Engineer's Degree in Aerospace Engineering from the Technical University Munich. His research lies in the area of computational fluid mechanics, with emphasis on stability theory, receptivity theory, flow control, model reduction, and system identification. He is also interested in methods for quantitative flow analysis for numerical and experimental data.
Host: Mihailo Jovanovic, mihailo@usc.edu
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 132
Audiences: Everyone Is Invited
Contact: Gerrielyn Ramos
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor. -
Networking for Big Data: Theory and Optimization for NDN
Tue, Aug 22, 2017 @ 02:00 PM - 03:00 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Edmund Yeh, Northeastern University
Talk Title: Networking for Big Data: Theory and Optimization for NDN
Abstract: The advent of Big Data is stimulating the development of new networking architectures which facilitate the acquisition, transmission, storage, and computation of data. In particular, Named Data Networking (NDN) is an emerging content-centric networking architecture which focuses on enabling end users to obtain the data they want, rather than to communicate with specific nodes. By naming content instead of their locations, NDN transforms data into a first-class network entity.
In this talk, we present a new analytical and design framework for the optimization of key network functionalities within the NDN architecture, which is also broadly applicable to content delivery and peer-to-peer networks. The framework includes the joint optimization of traffic engineering and caching strategies, in order to best utilize both bandwidth and storage for efficient content distribution. It also includes optimal congestion control when user demand for content becomes excessive. We first develop distributed and adaptive algorithms for joint request forwarding and dynamic cache placement and eviction, which effectively achieve network load balancing, thereby maximizing the user demand rate that the NDN network can satisfy. Next, we investigate fair congestion control for NDN. In the absence of source-destination pairs, traditional congestion control schemes are inappropriate. Instead, we develop content-based congestion control algorithms which naturally work in concert with forwarding and caching to achieve a favorable tradeoff between the aggregate user utility from admitted content requests and the total user delay. Numerical experiments within a number of network settings demonstrate the superior performance of these algorithms in terms of multiple metrics.
Joint work with Tracey Ho, Ying Cui, Ran Liu, Michael Burd, and Derek Leong
Biography: Edmund Yeh received his B.S. in Electrical Engineering with Distinction and Phi Beta Kappa from Stanford University in 1994. He then studied at Cambridge University on the Winston Churchill Scholarship, obtaining his M.Phil in Engineering in 1995. He received his Ph.D. in Electrical Engineering and Computer Science from MIT under Professor Robert Gallager in 2001. He is currently Professor of Electrical and Computer Engineering at Northeastern University. He was previously Assistant and Associate Professor of Electrical Engineering, Computer Science, and Statistics at Yale University. He has held visiting positions at MIT, Stanford, Princeton, UC Berkeley, EPFL, and TU Munich.
Professor Yeh was one of the PIs on the original NSF-funded FIA Named Data Networking project. He will serve as General Co-Chair for ACM Conference on Information Centric Networking (ICN) 2018 in Boston. He is the recipient of the Alexander von Humboldt Research Fellowship, the Army Research Office Young Investigator Award, the Winston Churchill Scholarship, the National Science Foundation and Office of Naval Research Graduate Fellowships, the Barry M. Goldwater Scholarship, the Frederick Emmons Terman Engineering Scholastic Award, and the President's Award for Academic Excellence (Stanford University). Professor Yeh has served as the Secretary of the Board of Governors of the IEEE Information Theory Society. He received the Best Paper Award at the 2015 IEEE International Conference on Communications (ICC) Communication Theory Symposium.
Host: Michael Neely, mjneely@usc.edu, EEB 520, x03505
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 248
Audiences: Everyone Is Invited
Contact: Gerrielyn Ramos
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor. -
Center for Cyber-Physical Systems and Internet of Things and Ming Hsieh Institute for Electrical Engineering Joint Seminar Series on Cyber-Physical Systems
Wed, Aug 23, 2017 @ 02:00 PM - 03:00 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Davide Bresolin, Assistant Professor, University of Padova, Italy, and Luca Geretti, Research Fellow, University of Verona, Italy
Talk Title: Formal Verification of Nonlinear Hybrid Systems using Ariadne
Abstract: In embedded systems design there is often the need to model complex systems having a mixed discrete and continuous behavior that cannot be characterized faithfully using either discrete or continuous models only. Such systems consist of a discrete control part that operates in a continuous environment and are named hybrid systems. Unfortunately, most of the verification problems for hybrid systems, like reachability analysis, turn out to be undecidable. Because of this, many approximation techniques and tools to estimate the reachable set have been proposed in the literature. However, most of the tools are unable to handle nonlinear dynamics and constraints, and do not perform conservative numerical rounding. In this seminary we present an open-source framework for hybrid system verification, called Ariadne, which exploits approximation techniques based on the theory of computable analysis for implementing formal verification algorithms.
Biography: Davide Bresolin received the Ph.D. degree in computer science from the University of Udine, Udine, Italy, in 2007. He is an Assistant Professor with the Mathematics Department, University of Padova, Italy. From 2007 to 2013, he was a Research Fellow with the Department of Computer Science, University of Verona, Verona, Italy, where he collaborated with the Electronic Systems Design Group (ESD) and the ALTAIR Robotics Group. From 2013 to 2016 he was an Assistant Professor with the Computer Science and Engineering Department, University of Bologna, Bologna, Italy. His research activity is focused on formal verification of cyber-physical and embedded systems using hybrid automata and temporal logics, on automata theory, and on temporal representation and reasoning using interval-based temporal logics.
Luca Geretti received the Laurea degree in electrical engineering and the Ph.D. degree in computer engineering from the University of Udine, Udine, Italy, in 2005 and 2009, respectively. He was a Research Fellow with the Department of Computer Science, University of Verona, Verona, Italy, between 2009 and 2011. He was a Research Fellow with the Department of Electrical Engineering, University of Udine, Udine, Italy, between 2012 and 2015. He is currently a Research Fellow with the Department of Computer Science, University of Verona, Verona, Italy. His current research interests are in the fields of formal verification of cyber-physical systems using hybrid automata, and of parallel and distributed computing.
Host: Pierluigi Nuzzo
Location: Hughes Aircraft Electrical Engineering Center (EEB) - EEB 132
Audiences: Everyone Is Invited
Contact: Estela Lopez
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor. -
Techniques for Content Delivery at Scale in Current and Future Network Architectures
Fri, Aug 25, 2017 @ 03:00 PM - 04:00 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Nishanth Sastry, King's College London
Talk Title: Techniques for Content Delivery at Scale in Current and Future Network Architectures
Abstract: On-demand video streaming dominates today's Internet traffic mix. For instance, Netflix constitutes a third of the peak time traffic in the USA. Nearly half of UK online households have accessed BBC's shows through its on-demand streaming interface, BBC iPlayer. Using UK-wide traces from BBC iPlayer as a case study, this talk will characterise users' content consumption at scale and discuss techniques that can be deployed at the edge by users to substantially decrease the load in the Internet. We will survey both well-known techniques such as peer-assisted video-on-demand, studying whether it works at scale, as well as new edge-caching mechanisms that can potentially be deployed today. We will conclude by exploring new directions for future network architectures, to address the roots of the pain points observed in our user workload, in a "clean" fashion.
Biography: Nishanth is a Senior Lecturer at King's College London. He holds a PhD from the University of Cambridge, UK, a Master's degree from The University of Texas at Austin, and a Bachelor's degree from Bangalore University, India, all in Computer Science. He has spent several years in Industry, at Cisco Systems and at IBM (both in the Software Group and at the TJ Watson Research Center).
His work in the last few years has focused on analysing large real-world datasets, funded by several grants from two different UK Research Councils (EPSRC and ESRC), as well as by the European Commission. He has given several keynotes about his work, and has frequently been featured in various TV shows and other media outlets including Nature News, New Scientist and BBC.
Host: Andreas Molisch, x04670, molisch@usc.edu
Location: 248
Audiences: Everyone Is Invited
Contact: Gerrielyn Ramos
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor. -
Center for Systems and Control (CSC@USC) and Ming Hsieh Institute for Electrical Engineering
Mon, Aug 28, 2017 @ 02:00 PM - 03:00 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Terence Sanger, University of Southern California
Talk Title: Rate coding, spike coding, and biological control
Series: Fall 2017 Joint CSC@USC/CommNetS-MHI Seminar Series
Abstract: Although biological and artificial computation must solve similar problems, they do so in very different ways. I will discuss several closely related topics in biological control systems. Risk-aware control is a set of human behaviors in asymmetric cost environments that set the groundwork and requirements for models of biological feedback control. Stochastic Dynamic Operators provide a set of tools for control of uncertain stochastic systems, and I show that these operators can implement risk aware control in a simple robotic visual targeting task. I also show how the calculations necessary for control and stabilization can be implemented in populations of asynchronous spiking neurons. Finally, I provide preliminary data from electrophysiological recordings in the brains of children with movement disorders that provide some clues as to how the human basal ganglia encode movement.
Biography: Dr. Terence Sanger is the director of the USC Pediatric Movement Disorders Center. His research focuses on understanding the origins of pediatric movement disorders from both a biological and a computational perspective. The primary goal of his research is to discover new methods for treating children with movement disorders. Dr. Sanger coordinates the Childhood Motor Study Group (CMSG) and the NIH Taskforce on Childhood Movement Disorders, and he is principal investigator on several research studies at USC. He runs the pediatric movement disorders clinic at Children's Hospital of Los Angeles (CHLA) in the department of Neurology. His training includes background in Child Neurology, Electrical Engineering, Signal Processing, Control Theory, Neural Networks, and Computational Neuroscience.
Host: Mihailo Jovanovic, mihailo@usc.edu
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 132
Audiences: Everyone Is Invited
Contact: Gerrielyn Ramos
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor. -
The Convergence of Machine Learning, Big Data, and Supercomputing
Tue, Aug 29, 2017 @ 10:30 AM - 11:30 PM
Thomas Lord Department of Computer Science, Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Dr. Jeremy Kepner, MIT Lincoln Laboratory Fellow/MIT Lincoln Laboratory Supercomputing Center Founder
Talk Title: The Convergence of Machine Learning, Big Data, and Supercomputing
Abstract: Machine learning, big data and simulation challenges have led to a proliferation of computing hardware and software solutions. Hyperscale data centers, accelerators and programmable logic can deliver enormous performance via a range of analytic environments and data-storage technologies. Effectively exploiting these capabilities for science and engineering requires mathematically rigorous interfaces that allow scientists and engineers to focus on their research and avoid rewriting software each time computing technology changes. Mathematically rigorous interfaces are at the core of the MIT Lincoln Laboratory Supercomputing Center and let it deliver leading-edge technologies to thousands of scientists and engineers. This talk discusses the rapidly evolving computing landscape and how mathematically rigorous interfaces are key to exploiting advanced computing capabilities.
Biography: Dr. Jeremy Kepner is a MIT Lincoln Laboratory Fellow. He founded the Lincoln Laboratory Supercomputing Center and pioneered the establishment of the Massachusetts Green High Performance Computing Center. He has developed novel big data and parallel computing software used by thousands of scientists and engineers worldwide. He has led several embedded computing efforts, which earned him a 2011 R&D 100 Award. Dr. Kepner has chaired SIAM Data Mining, IEEE Big Data, and the IEEE HPEC conference. Dr. Kepner is the author of two bestselling books on Parallel MATLAB and Graph Algorithms. His peer-reviewed publications include works on abstract algebra, astronomy, astrophysics, cloud computing, cybersecurity, data mining, databases, graph algorithms, health sciences, plasma physics, signal processing, and 3D visualization. In 2014, he received Lincoln Laboratory's Technical Excellence Award. Dr. Kepner holds a B.A. in astrophysics from Pomona College and a Ph.D. in astrophysics from Princeton University.
Host: Dr. Viktor K. Prasanna
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 248
Audiences: Everyone Is Invited
Contact: Kathy Kassar
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor. -
EE 598 Computer Engineering Seminar Series
Thu, Aug 31, 2017 @ 02:00 PM - 03:15 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Rakesh Kumar, University of Illinois at Urbana Champaign
Talk Title: Ultra Low Power Computing in the IoT Era
Series: EE 598 Computer Engineering Seminar Series
Abstract: Wearables, sensors, and Internet of Things (IoT) arguably represent the next frontier of computing. They will be characterized by extremely low power and area requirements. In our recent research, we asked the question: are there opportunities for power and area reduction that are unique to these emerging computing platforms. We answered the question in the affirmative and developed several techniques that appear to be very effective. In this talk, I will focus one such technique--symbolic hardware-software co-analysis--that is applicable over a wide class of applications. Through a novel symbolic execution-based approach, we can determine for a given application the gates in the hardware that the application is guaranteed to not touch. This information can then be used to determine application-specific Vmin, determine application-specific peak power, and, build bespoke processors customized to a given application. If time permits, I will also discuss how architectural ideas such bit serial processors and k-hot pipelining may become promising for the IoT applications.
Biography: Rakesh Kumar is an Associate Professor in the Electrical and Computer Engineering Department at the University of Illinois at Urbana Champaign and a Co-Founder and Chief Architect at Hyperion Core, Inc. He has made contributions in the area of processor design and memory system design that have directly impacted industry and state-of-art. His current research interests are in computer architecture, low power and error resilient computer systems, and approximate computing. He has a B-Tech from IIT Kharagpur and a PhD from University of California at San Diego. He is often seen at a restaurant or hanging out with his very active four-year old.
Host: Xuehai Qian, x04459, xuehai.qian@usc.edu
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 132
Audiences: Everyone Is Invited
Contact: Gerrielyn Ramos
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor. -
PhD Defense: Sampling Theory for Graph Signals with Applications to Semi-supervised Learning
Thu, Aug 31, 2017 @ 03:30 PM - 05:30 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Aamir Anis, USC
Talk Title: PhD Defense: Sampling Theory for Graph Signals with Applications to Semi-supervised Learning
Abstract: The representation, processing and analysis of large-scale data as signals defined over graphs has drawn much interest recently. Graphs allow us to embed natural inter-connectivities between data points and exploit them during processing. As a result, graph signal processing has laid a strong foothold in various modern application domains such as machine learning, analysis of social, transportation, web and sensor networks, and even traditional areas such as image processing and video compression. Although powerful, this research area is still in its infancy. Recent efforts have therefore focused on translating well-developed tools of traditional signal processing for handling graph signals.
An important aspect of graph signal processing is defining a notion of frequency for graph signals. A frequency domain representation for graph signals can be defined using the eigenvectors and eigenvalues of variation operators (e.g., graph Laplacian) that take into account the underlying graph connectivity. These operators can also be used to design graph spectral filters. The primary focus of our work is to develop a theory of sampling for graph signals that answers the following questions: 1. When can one recover a graph signal from its samples on a given subset of nodes of the graph? 2. What is the best choice of nodes to sample a given graph signal? Our formulation primarily works under the assumption of bandlimitedness in the graph Fourier domain, which amounts to smoothness of the signal over the graph. The techniques we employ to answer these questions are based on the introduction of special quantities called graph spectral proxies that allow our algorithms to operate in the vertex domain, thereby admitting efficient, localized implementations.
We also explore the sampling problem in the context of designing wavelet filterbanks on graphs. This problem is fundamentally different since one needs to choose a sampling scheme jointly over multiple channels of the filterbank. We explore constraints for designing perfect reconstruction two-channel critically-sampled filterbanks with low-degree polynomial filters, and conclude that such a design is in general not possible for arbitrary graphs. This leads us to propose an efficient technique for designing a critical sampling scheme that, given pre-designed filters, aims to minimize the overall reconstruction error of the filterbank. We also explore M-channel filterbanks over M-block cyclic graphs (that are natural extensions of bipartite graphs), and propose a tree-structured design in a simpler setting when M is a power of 2.
As an application, we study the graph-based semi-supervised learning problem from a sampling theory point of view. A crucial assumption here is that class labels form a smooth graph signal over a similarity graph constructed from the feature vectors. Our analysis justifies this premise by showing that in the asymptotic limit, the bandwidth (a measure of smoothness) of any class indicator signal is closely related to the geometry of the dataset. Using the sampling theory perspective, we also quantitatively show that the label complexity (i.e., the amount of labeling required for perfect prediction of unknown labels) matches its theoretical value, thereby adding to the appeal of graph-based techniques for semi-supervised learning.
Biography: Aamir Anis received his Bachelor and Master of Technology degree in Electronics and Electrical Communication Engineering from the Indian Institute of Technology (IIT), Kharagpur, India, in 2012. He joined the Electrical Engineering department at the University of Southern California (USC), Los Angeles, in 2012, where he has been working towards a Ph.D. degree in Electrical Engineering. He has been the recipient of the Best Student Paper award at ICASSP 2014. His research interests include graph signal processing with applications in machine learning, and multimedia compression.
Host: Dr. Antonio Ortega
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 248
Audiences: Everyone Is Invited
Contact: Gloria Halfacre
This event is open to all eligible individuals. USC Viterbi operates all of its activities consistent with the University's Notice of Non-Discrimination. Eligibility is not determined based on race, sex, ethnicity, sexual orientation, or any other prohibited factor.
