Problem

Results: 43643



#Item
821

Identifying and attacking the saddle point problem in high-dimensional non-convex optimization Razvan Pascanu Universit´e de Montr´eal

Add to Reading List

Source URL: arxiv.org

- Date: 2014-06-10 20:21:26
    822

    Texture Synthesis for Digital Painting John Peter Lewis Massachusetts Institute of Technology Abstract The problem of digital painting is considered from a signal processing viewpoint, and is reconsidered as a problem of

    Add to Reading List

    Source URL: www.scribblethink.org

    - Date: 2008-03-24 23:35:10
      823

      Microsoft Word - Unidentified – The National Intelligence Problem of UFOs.docx

      Add to Reading List

      Source URL: treatisepublishing.com

      - Date: 2017-06-09 20:56:54
        824

        Parkland Humane Society Difficulty/Concern Identification Form This form is a tool to assist volunteers/visitors to identify and report a problem or concern that they have encountered with regards to the Parkland Humane

        Add to Reading List

        Source URL: www.parklandhumanesociety.com

        - Date: 2016-02-13 17:54:32
          825

          Improved upper bounds in the moving sofa problem Yoav Kallus∗ Dan Romik† January 5, 2018

          Add to Reading List

          Source URL: www.math.ucdavis.edu

          - Date: 2018-01-15 13:55:39
            826

            Differential equations and exact solutions in the moving sofa problem Dan Romik∗ July 10, 2016 Abstract

            Add to Reading List

            Source URL: www.math.ucdavis.edu

            - Date: 2016-07-10 20:31:56
              827

              PAC-Bayesian Online Clustering Le L I*, Benjamin G UEDJ† and Sébastien L OUSTAU‡ January 28, 2016 Abstract This paper addresses the online clustering problem. When faced with

              Add to Reading List

              Source URL: bguedj.github.io

              - Date: 2018-03-21 04:06:23
                828

                Approximation Algorithm for the Kinetic Robust K-Center Problem Sorelle A. Friedlera,∗,1 , David M. Mounta,2 a Department of Computer Science

                Add to Reading List

                Source URL: sorelle.friedler.net

                - Date: 2016-04-17 13:12:00
                  829

                  CS364A: Problem Set #4 Due to the TAs by noon on Friday, November 22, 2013 Instructions: (0) We’ll grade this assignment out of a total of 75 points; if you earn more than 75 points on it, the extra points will be trea

                  Add to Reading List

                  Source URL: theory.stanford.edu

                  - Date: 2013-11-08 00:36:44
                    830

                    UNFOLDING FOLDS MATTHEW WEAVER AND DIMITRIS TSEMENTZIS A well-known problem in Homotopy Type Theory is that of constructing objects that seemingly require infinitely many coherence conditions in their definition. One sol

                    Add to Reading List

                    Source URL: hott-uf.github.io

                    - Date: 2018-03-28 14:04:14
                      UPDATE