Naor

Results: 103



#Item
41

Computational Models of Symbolic Rhythm Similarity: Correlation with Human Judgments1 Godfried T. Toussaint Malcolm Campbell Naor Brown 1. INTRODUCTION

Add to Reading List

Source URL: cgm.cs.mcgill.ca

Language: English - Date: 2015-03-06 02:09:42
    42

    New Hardness Results for Congestion Minimization and Machine Scheduling Julia Chuzhoy Joseph (Seffi) Naor

    Add to Reading List

    Source URL: ttic.uchicago.edu

    Language: English - Date: 2008-07-08 17:49:35
      43

      Algorithmic Game Theory Lecture on July 18th Kurt Mehlhorn and Rob van Stee July 14, 2011 We discuss the paper Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue by Buchbinder, Jain, and Naor [BJN07]. The p

      Add to Reading List

      Source URL: resources.mpi-inf.mpg.de

      Language: English - Date: 2011-07-14 07:41:54
        44

        New Hardness Results for Congestion Minimization and Machine Scheduling JULIA CHUZHOY CSAIL MIT and Dept. of CIS, University of Pennsylvania and JOSEPH (SEFFI) NAOR

        Add to Reading List

        Source URL: ttic.uchicago.edu

        Language: English - Date: 2008-05-29 15:38:12
          45

          How Efficient can Memory Checking be? Cynthia Dwork∗ Moni Naor† Guy N. Rothblum‡

          Add to Reading List

          Source URL: www.wisdom.weizmann.ac.il

          - Date: 2008-12-28 07:24:27
            46

            Fast Interactive Coding Against Adversarial Noise∗ Zvika Brakerski† Yael Tauman Kalai‡ Moni Naor§

            Add to Reading List

            Source URL: www.wisdom.weizmann.ac.il

            - Date: 2014-08-07 15:07:19
              47

              Randomized Algorithms 2013A – Final Exam Robert Krauthgamer and Moni Naor February 17, 2013 General instructions. The exam has 2 parts. You have 3 hours. No books, notes, cell phones, or other external materials are al

              Add to Reading List

              Source URL: www.wisdom.weizmann.ac.il

              - Date: 2014-11-12 02:00:51
                48

                Randomized Algorithms 2015A – Problem Set 2 Robert Krauthgamer and Moni Naor Due: December 30, Analyze the construction below of a stretch 3 distance oracle for a graph G, and show that its storage requirement

                Add to Reading List

                Source URL: www.wisdom.weizmann.ac.il

                - Date: 2014-12-31 19:10:51
                  49

                  Veri cation of a human in the loop or Identi cation via the Turing Test Moni Naor y

                  Add to Reading List

                  Source URL: www.wisdom.weizmann.ac.il

                  Language: English - Date: 2011-06-02 14:00:47
                    50

                    Fast Algorithms for Interactive Coding Zvika Brakerski∗ Moni Naor† Abstract

                    Add to Reading List

                    Source URL: www.wisdom.weizmann.ac.il

                    Language: English - Date: 2012-11-12 15:04:54
                      UPDATE