IEEE Boise Section

Come and watch a remote presentation from Thomas Deselaers, a machine learning specialist at Google. Thomas Deselaers received the PhD and diploma degrees from RWTH Aachen University in Germany. He is a software engineer at Google Switzerland. Prior he was a postdoc in the computer vision group of ETH Zurich in Switzerland. His research interests include applied machine learning, mobile computing, and combinations of these. See http://thomas.deselaers.de/ https://ai.google/research/people/ThomasDeselaers https://quickdraw.withgoogle.com/   <- his team developed this and this will be a part of his talk. https://www.blog.google/technology/ai/quick-draw-one-billion-drawings-around-world/ Event will be cohosted by the IEEE Boise State Student Branch, Boise State AI Club, and the IEEE Boise Computer Society. Location: Room: MEC 106 Bldg: Micron Engineering Center Boise State University 1020 S. Manitou Ave. Boise, Idaho

Wireless networks of the future, such as the Internet of Things, are envisioned to be highly heterogeneous. In many applications, one is interested in optimally deploying a network of nonidentical nodes to a ceWireless networks of the future, such as the Internet of Things, are envisioned to be highly heterogeneous. In many applications, one is interested in optimally deploying a network of nonidentical nodes to a certain area of interest. These networks may include a multitude of connected autonomous nodes in one or more tiers. We formulate these deployment problems as quantizer design problems where different distortion measures should be associated with different quantization indices. We discuss fundamental design challenges like the best spatial deployment of nodes to minimize the energy consumption or maximize the sensing accuracy while guaranteeing network connectivity. This is done by developing a quantization theory of heterogeneous reproduction points. We will discuss the characteristics of such a heterogeneous quantization theory and show that some of the standard results of the traditional quantization theory, including Gersho's conjecture, do not hold.rtain area of interest. These networks may include a multitude of connected autonomous nodes in one or more tiers. We formulate these deployment problems as quantizer design problems where different distortion measures should be associated with different quantization indices. We discuss fundamental design challenges like the best spatial deployment of nodes to minimize the energy consumption or maximize the sensing accuracy while guaranteeing network connectivity. This is done by developing a quantization theory of heterogeneous reproduction points. We will discuss the characteristics of such a heterogeneous quantization theory and show that some of the standard results of the traditional quantization theory, including Gersho's conjecture, do not hold. Speaker(s): Professor Hamid Jafarkhani, Location: Room: RUCH 103 Bldg: Boise State University Boise, Idaho 83706

Join us Thursday, November 1st at 4:30PM in RUCH 110 for a presentation from Perry Lea on Fundamental Barriers in Computer Science. This event is free and open to the public. It will be cohosted by the IEEE Boise State Student Branch and the IEEE Boise Computer Society. Speaker(s): Perry Lea, Location: Room: RUCH 110 Bldg: Ruch Engineering Bldg Boise State University 1375 W. University Dr. Boise, Idaho