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

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

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

  • Oblivious Algorithms - How to Serve in the Dark

    דובר:
    Yossi Azar - Colloquium Lecture
    תאריך:
    יום שלישי, 5.5.2015, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20150505_14_30_Azar.html
  • ceClub: Secure Network Coding Schemes for Wireless and Data Storage Networks

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

    Weakly secure codes aim to hide information about individual packets as well as small groups of packets from an eavesdropper that can intercept wireless transmissions or has access to a small number of storage nodes. Such codes are a practical alternative to traditional information-theoretic schemes that hide information about the entire set of files from the eavesdropper. The weakly secure codes do not use random keys, and as a result have better performance and lower overhead than the traditional schemes.

    The talk will include two parts. First, we will present an algorithm for constructing weakly secure codes that enable clients to exchange data over a shared broadcast channel in the presence of an eavesdropper. We show that this problem has many interesting reformulations, such as designing constrained generator matrices of MDS codes and leads to interesting conjectures in algebraic geometry and abstract algebra. Second, we present an explicit construction of a coset coding based outer code to enhance the weak security properties of a regeneration code, i.e., a code which optimizes the repair bandwidth in a distributed storage system.

    Bio:
    Dr. Sprintson is an Associate Professor in the Department of Electrical and Computer Engineering, Texas A&M University, College Station. >From 2003 to 2005, he was a Postdoctoral Research Fellow at the California Institute of Technology, Pasadena. His research interests lie in the general area of communication networks with a focus on network coding and software defined networks. Dr. Sprintson received the Wolf Award for Distinguished Ph.D.students, the Viterbi Postdoctoral Fellowship, and the NSF CAREER award. Currently, he serves as an associate editor of the IEEE Transactions on Wireless Communications. He has been a member of the Technical Program Committee for the IEEE Infocom 2006–2016.

  • Theory Seminar: Publicly Verifiable Software Watermarking

    דובר:
    אלוני כהן (MIT)
    תאריך:
    יום רביעי, 6.5.2015, 12:30
    מקום:
    טאוב 201

    Abstract: Software Watermarking is the process of transforming a program into a functionally equivalent “marked” program in such a way that it is computationally hard to remove the mark without destroying functionality. Barak, Goldreich, Impagliazzo, Rudich, Sahai, Vadhan and Yang (CRYPTO 2001) defined software watermarking and showed that the existence of indistinguishability obfuscation implies that software watermarking is impossible. Given the recent candidate constructions of indistinguishability obfuscation, this result paints a bleak picture for the possibility of meaningful watermarking.

    We show that slightly relaxing the functionality requirement gives us strong positive results for watermarking. Namely, instead of requiring the marked program to agree with the original unmarked program on all inputs, we require only that they agree on a large fraction of inputs. With this relaxation in mind, our contributions are as follows.

    1. We define publicly verifiable watermarking where marking a program requires a secret key, but anyone can verify that a program is marked. The handful of existing watermarking schemes are secretly verifiable, and moreover, satisfy only a weak definition where the ad- versary is restricted in the type of unmarked programs it is allowed to produce (Naccache, Shamir and Stern, PKC 1999; Nishimaki, EUROCRYPT 2013). Moreover, our definition requires security against chosen program attacks, where an adversary has access to an oracle that marks programs of her choice.

    2. We construct a publicly verifiable watermarking scheme for any family of puncturable pseudo-random functions (PPRF), assuming indistinguishability obfuscation and injective one-way functions.

    We also give an indication of the limits of watermarking by constructing "unwatermarkable" families of pseudorandom functions.

    Joint work with Justin Holmgren and Vinod Vaikuntanathan.

  • TCE Guest Lecture: Fine Grain Memory Deduplication

    דובר:
    מארק הורוביץ (אונ' סטנפורד)
    תאריך:
    יום חמישי, 7.5.2015, 11:30
    מקום:
    חדר 1003 (קומה 10), בניין מאייר, הפקולטה להנדסת חשמל

    Memory is a large component of computer system cost and current trends indicate this cost is increasing as a fraction of the total. Emerging applications such as in-memory databases, virtual machines, and big-data key-value stores demand more memory relative to compute. Some of these high-memory applications incidentally store many duplicate values in memory: in some cases, duplicates account for over 75% of the total. This talk describes a practical deduplicated memory that is compatible with existing hardware and software. Memory content from actual workloads indicates that deduplicated memory can effectively double your memory capacity. After describing a baseline memory design and reporting on its performance and bandwidth requirements, we next describe optimizations of this system that reduce memory traffic and improve performance relative to both the baseline deduplicated memory and, in many cases, relative to the original machine. This was a derivative of the original HICAMP idea, which was acquired by Intel last year.

    Bio:
    Mark Horowitz received his BS and MS in Electrical Engineering from MIT in 1978, and his PhD from Stanford in 1984. Since 1984 he has been a professor at Stanford working in the area of digital integrated circuit design. While at Stanford he has led a number of processor designs including: MIPS-X, one of the first processors to include an on-chip instruction cache; Torch, a statically-scheduled, superscalar processor; Flash, a flexible DSM machine; and Smash, a reconfigurable polymorphic manycore processor. He has also worked in a number of other chip design areas including high-speed memory design, high-bandwidth interfaces, and fast floating point. In 1990 he took leave from Stanford to help start Rambus Inc, a company designing high-bandwidth memory interface technology.

  • הרצאה טכנית של אפל: גלו מה אפשרי

    הרצאה טכנית של אפל: גלו מה אפשרי

    דובר:
    אהרן אהרן (אפל)
    תאריך:
    יום רביעי, 13.5.2015, 12:30
    מקום:
    חדר 1003 (קומה 10), בניין מאייר, הפקולטה להנדסת חשמל

    הרצאה טכנית מפי אהרן אהרן מחברת אפל תתקיים ביום ד', 13 במאי 2015, בשעה 12:30, באולם 1003 (קומה 10), בניין מאייר להנדסת חשמל.

    כולם מוזמנים.

  • Online Semidefinite Programming

    דובר:
    נועה אלעד, הרצאה סמינריונית למגיסטר
    תאריך:
    יום רביעי, 13.5.2015, 14:30
    מקום:
    טאוב 601
    מנחה:
    Prof. Joseph (Seffi) Naor

    We define a new class of semi-definite programs in which the input arrives online. We use the primal dual method to develop an algorithm for this setting of semi-definite programs while maintaining the monotonicity requirements of an online algorithm. Our algorithm achieves logarithmic competitive ratios for both the primal and dual problems. We will discuss applications from quantum information theory, such as the Quantum Hypergraph Covering problem, and also observe the behavior of this algorithm on well studied problems such as Max Cut and Set Cover.

  • Optimization and Reoptimization in Scheduling Problems

    דובר:
    יעל מרדכי, הרצאה סמינריונית למגיסטר
    תאריך:
    יום רביעי, 13.5.2015, 16:30
    מקום:
    טאוב 601
    מנחה:
    Prof. Hadas Shachnai

    Parallel machine scheduling has been extensively studied in the past decades, with applications ranging from production planning to job processing in large computing clusters. We study some of these fundamental optimization problems, as well as their reoptimization variants. In this talk, we present improved bounds for job scheduling on unrelated parallel machines, with the objective of minimizing the latest completion time (or, makespan) of the schedule. We consider the subclass of fully-feasible instances, in which the processing time of each job, on any machine, does not exceed the minimum makespan. The problem is known to be hard to approximate within factor 4/3 already in this subclass. Although fully-feasible instances are hard to identify, we give a polynomial time algorithm that yields for such instances a schedule whose makespan is better than twice the optimal, the best known ratio for general instances. Moreover, we show that our result is robust under small violations of feasibility constraints. We further study the power of parameterization and show that makespan minimization on unrelated parallel machines admits a parameterized approximation scheme, where the parameter used is the number of processing times that are large relative to the latest completion time of the schedule.

  • יריד פרוייקטים ראשון במדעי המחשב

    יריד פרוייקטים ראשון במדעי המחשב

    תאריך:
    יום שלישי, 26.5.2015, 15:30
    מקום:
    בניין טאוב למדעי המחשב

    אנו שמחים להזמינכם ליריד פרוייקטים ראשון בפקולטה למדעי המחשב אשר יתקיים ביום ג', 26 במאי 2015, בין השעות 15:30-18:00, בלובי בניין טאוב למדעי המחשב.
    .
    באירוע, בו יתארחו נציגים בכירים מהתעשייה ומחברות מובילות בהי-טק, יציגו סטודנטים לתואר ראשון פרוייקטים שפיתחו במהלך לימודיהם.

    האירוע הוא הזדמנות מצויינת הן עבור התעשייה להיחשף להבטים יישומיים שנלמדים במהלך התואר, ולהכיר את יכולות הפיתוח והיישום של הסטודנטים, לטובת שיתופי פעולה עתידיים, הן עבור סטודנטים צעירים לגלות התנסויות עתידיות הצפויות להם במהלך לימודיהם.

    ההשתתפות באירוע אינה כרוכה בתשלום אך דורשת הרשמה מוקדמת.

    כולם מוזמנים!

  • אירוע בוגרי תארים מתקדמים במדעי המחשב

    אירוע בוגרי תארים מתקדמים במדעי המחשב

    תאריך:
    יום חמישי, 11.6.2015, 15:00
    מקום:
    בניין טאוב למדעי המחשב

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

    האירוע יתקיים ביום חמישי,11 ביוני 2015 בבניין טאוב למדעי המחשב וייערך בו (החל מהשעה 15:30) יום עיון מרתק בהשתתפות מרצים ידועים: פרופ' אמנון שעשוע, פרופ' חוסאם חאיק, פרופ' מיכאל אבירם וד"ר חיים שפירא. ובהמשך הערב (החל מהשעה 19:00) אירוע חברתי נטוורקינג ואמן אורח – ליאור סושרד

    תוכנית והרשמה מראש.

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

    מקווים לראותכם!