קולוקוויום וסמינרים

כדי להצטרף לרשימת תפוצה של קולוקוויום מדעי המחשב, אנא בקר בדף מנויים של הרשימה.


Computer Science events calendar in HTTP ICS format for of Google calendars, and for Outlook.

Academic Calendar at Technion site.

קולוקוויום וסמינרים בקרוב

  • Pixel Club:On Thinning Transducer Arrays for Ultrasound Imaging using Multiplicative Beamforming

    דובר:
    עומרי סוציאנו (הנדסת חשמל, טכניון)
    תאריך:
    יום שלישי, 26.9.2017, 11:30
    מקום:
    חדר 815, בניין מאייר, הפקולטה להנדסת חשמל

    Element reduction in ultrasound transducers allows for several benefits, such asmore compact ultrasound systems and more efficient implementation of signal enhancement algorithms. However, element thinning poses two main challenges: SNR (signal to noise ratio) reduction and interference through grating lobes.

    Through the use of multiplicative beamforming in ultrasound systems, we decrease the number of processed elements in the transducer while preserving the beam pattern. Thus, we reduce the number of processed received elements by a square root factor. We improve the SNR by employing new algorithms developed for the smaller number of processed elements. Coherence factor multiplication is used for incoherent noise reduction. Strong reflectors separation allows for CNR (contrast to noise ratio) improvement. Retrospective transmit beamforming allows for improved lateral resolution. Our imaging results show improvement over full array echocardiography.

    ​*​M.Sc. research under the supervision of Prof. Moshe Porat (EE, Technion) and Dr. Zvi Friedman (GE Healthcare).

  • Complexity-Theoretic Foundations of Quantum Supremacy Experiments

    דובר:
    Scott Aaronson - COLLOQUIUM LECTURE
    תאריך:
    יום שלישי, 7.11.2017, 14:30
    מקום:
    חדר 337 טאוב.
    השתייכות:
    University of Texas, Austin, Computer Science
    מארח:
    Yuval Filmus

    In the near future, there will likely be special-purpose quantum computers with 50 or so high-quality qubits. In this talk, I'll discuss general theoretical foundations for how to use such devices to demonstrate "quantum supremacy": that is, a clear quantum speedup for *some* task, motivated by the goal of overturning the Extended Church-Turing Thesis (which says that all physical systems can be efficiently simulated by classical computers) as confidently as possible. Based on recent joint work with Lijie Chen, https://arxiv.org/abs/1612.05903 Short Bio: ========== Scott Aaronson is David J. Bruton Centennial Professor of Computer Science at the University of Texas at Austin. He received his bachelor's from Cornell University and his PhD from UC Berkeley, and did postdoctoral fellowships at the Institute for Advanced Study as well as the University of Waterloo. Before coming to UT Austin, he spent nine years as a professor in Electrical Engineering and Computer Science at MIT. Aaronson's research in theoretical computer science has focused mainly on the capabilities and limits of quantum computers. His first book, Quantum Computing Since Democritus, was published in 2013 by Cambridge University Press. He has received the National Science Foundation's Alan T. Waterman Award, the United States PECASE Award, the Vannevar Bush Fellowship, the Simons Investigator award, and MIT's Junior Bose Award for Excellence in Teaching. ======================================== Refreshments will be served from 14:15 Lecture starts at 14:30