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

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

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

  • Scalable algorithms for translating natural language to logical form

    דובר:
    Jonathan Berant - CS-Lecture
    תאריך:
    יום ראשון, 21.12.2014, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20141221_14_30_Bernat.html
  • Advances in Traffic Engineering and Discrepancy

    דובר:
    Roy Schwartz - CS-Lecture - REVISED -
    תאריך:
    יום שני, 22.12.2014, 11:00
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20141222_11_00_Schwarz.html
  • ceClub: Crowdsourcing a Meeting of Minds

    דובר:
    מיכאל ברנשטיין (אונ' סטנפורד)
    תאריך:
    יום שני, 22.12.2014, 13:30
    מקום:
    חדר 337, בניין טאוב למדעי המחשב

    Crowdsourcing is an increasingly powerful method for combining amateurs' efforts to recreate an expert's abilities. However, across domains from design to engineering to art, few goals are truly the effort of just one person — even one expert. If we can now crowdsource simple tasks such as image labeling, how might we coordinate many peoples' abilities toward far more complex and interdependent goals? In this talk, I present computational systems for gathering and guiding crowds of experts --- including professional programmers, designers, singers and artists. The resulting collectives tackle problems modularly and at scale, dynamically grow and shrink depending on task demands, and combine into larger organizations. I'll demonstrate how these expert crowds, which we call Flash Teams, can pursue goals such as designing new user experiences overnight and producing animated shorts in two days.

    Bio:
    Michael Bernstein is an Assistant Professor of Computer Science at Stanford University, where he co-directs the Human-Computer Interaction group and is a Robert N. Noyce Family Faculty Scholar. His research in human-computer interaction focuses on the design of crowdsourcing and social computing systems. This work has received Best Paper awards and nominations at premier venues in human-computer interaction and social computing (ACM UIST, ACM CHI, ACM CSCW, AAAI ISWSM). Michael has been recognized with the NSF CAREER award, as well as the George M. Sprowls Award for best doctoral thesis in Computer Science at MIT. He holds Ph.D. and M.S. degrees in Computer Science from MIT, and a B.S. in Symbolic Systems from Stanford University.

    Light refreshments will be served.

  • Theory Seminar:Inapproximability of Nash Equilibrium

    דובר:
    אביעד רובינשטיין (אונ' ברקלי)
    תאריך:
    יום רביעי, 24.12.2014, 12:30
    מקום:
    טאוב 401

    We prove that finding an epsilon-approximate Nash equilibrium is PPAD-complete for constant epsilon and a particularly simple class of games: polymatrix, degree 3 graphical games, in which each player has only two actions. As corollaries, we also prove similar inapproximability results for Bayesian Nash equilibrium in a two-player incomplete information game with a constant number of actions, for market equilibrium in a non-monotone market, for the generalized circuit problem defined in [Chen, Deng, Teng, 2009], and for approximate competitive equilibrium from equal incomes with indivisible goods.

  • Lessons Learned from and for Requirements Engineering and Building Construction: A Case Study of Requirements Engineering for a Synagogue Kitchen with Use Cases and Scenarios

    דובר:
    Daniel M. Berry - Colloquium Lecture -
    תאריך:
    יום רביעי, 24.12.2014, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20141224_14_30_Berry.html
  • Regression Testing of Security Updates Using Deterministic Record/Replay Infrastructure

    דובר:
    איליה קרביץ, הרצאה סמינריונית למגיסטר
    תאריך:
    יום רביעי, 24.12.2014, 16:30
    מקום:
    טאוב 401
    מנחה:
    Dan Tsafrir

    After a software product is shipped, it typically goes into a maintenance phase whereby related software updates are made available form time to time. Such updates should in principle have a positive effect (e.g. fixing bugs), but in reality the users often favor stability over the possible improvements brought by updates, worrying about the possibility of updates somehow adversely affecting their systems. However, leaving security vulnerabilities fixes unapplied might lead to highly undesirable consequences, such as denial of service or system compromise. To lower the risk of an update a staging environment can be created, containing the system replica to which an update is first applied. Then a regression testing is performed, ensuring the updated system still behaves correctly. This testing is usually a laborious manual process, limiting a frequency at which it can be performed. Deterministic Record/Replay is an ability of the system to precisely reproduce its previous execution. Such systems usually employ a combination of state snapshots with an event log, populated during record phase and used to guide the execution of replay phase. In this work we study security updates of a real life systems and applicability of deterministic record/replay techniques for automating regression testing of such updates.

  • An Algorithmic Approach for Analyzing Social Phenomena

    דובר:
    Sigal Oren - CS-Lecture
    תאריך:
    יום ראשון, 28.12.2014, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20141228_14_30_Oren.html
  • Machine-Learning the Hidden Universal Semantics of Natural Languages

    דובר:
    Omri Abend - CS-Lecture -
    תאריך:
    יום שני, 29.12.2014, 14:30
    מקום:
    חדר 401 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20141229_14_30_Abend.html
  • How to reach unreachable computers

    דובר:
    Prof. Adi Shamir - Colloquium Lecture -
    תאריך:
    יום שלישי, 30.12.2014, 14:30
    מקום:
    חדר Auditorium 1 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20141230_14_30_Shamir.html
  • Fast matrix multiplication: Limitations of the Coppersmith-Winograd approach

    דובר:
    Yuval Filmus - CS-Lecture -
    תאריך:
    יום רביעי, 31.12.2014, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20141231_14_30_Filmus.html
  • Aspects of Submodular Maximization Subject to a Matroid Constraint

    דובר:
    Moran Feldman - CS-Lecture
    תאריך:
    יום חמישי, 1.1.2015, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20150101_14_30_Feldman.html
  • Exponential Separation of Information and Communication

    דובר:
    Gillat Kol- CS-Lecture -
    תאריך:
    יום שני, 5.1.2015, 14:30
    מקום:
    חדר Class 4, Floor 1, טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20150105_14_30_Kol.html
  • Uncertainty, Strategy, and Bounded Rationality

    דובר:
    Reshef Meir - CS-Lecture
    תאריך:
    יום שלישי, 6.1.2015, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20150106_14_30_Reshef.html
  • Parallel Repetition From Fortification

    דובר:
    Dana Moshkovitz - Colloquium Lecture -
    תאריך:
    יום חמישי, 8.1.2015, 12:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20150108_12_30_Moshkovitz.html
  • When Exactly Do Quantum Computers Provide a Speedup?

    דובר:
    Scott Aaronson - Colloquium Lecture
    תאריך:
    יום חמישי, 8.1.2015, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20150108_14_30_Aaronson.html
  • CGGC Seminar: Voronoi diagram of line segments and convex polygons with convex polygon-offset distance functions

    דובר:
    מינאטי דה (מדעי המחשב, טכניון)
    תאריך:
    יום ראשון, 11.1.2015, 14:30
    מקום:
    טאוב 401

    Voronoi diagrams are one of the most powerful data structures in computational geometry. Barequet, Dickerson, and Goodrich [D&CG 2001] introduced the notion of polygon-offset distance function for points. The polygon-offset distance function is more natural than scaling and is useful to model many problems which arise in manufacturing tolerances. Using this distance function, they studied the nearest- and farthest-site Voronoi diagrams of point sites in the plane. In this talk, I will generalize the polygon-offset distance function to convex polygonal objects and present the combinatorial complexity of the nearest - and farthest-site Voronoi diagrams of line segments and convex polygons.

  • Coding For Interactive Communication

    דובר:
    Klim Efremenko - CS-Lecture -
    תאריך:
    יום שני, 12.1.2015, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20150112_14_30_Efremenko.html