Computational problems

Results: 809



#Item
1Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un

Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un

Add to Reading List

Source URL: web.eecs.umich.edu

Language: English
    2On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is

    On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is

    Add to Reading List

    Source URL: www.mathematik.uni-leipzig.de

    Language: English - Date: 2013-11-18 06:32:25
      3Problems Quantifiers Computational Epistemology Identifiability General question

      Problems Quantifiers Computational Epistemology Identifiability General question

      Add to Reading List

      Source URL: www.ninagierasimczuk.com

      Language: English - Date: 2012-04-16 16:01:55
        4Recreational Linguistics Series Ed.: Radev, Dragomir This series brings together, for the first time in one collection, the best English-language problems created for students competing in the Computational Linguistics O

        Recreational Linguistics Series Ed.: Radev, Dragomir This series brings together, for the first time in one collection, the best English-language problems created for students competing in the Computational Linguistics O

        Add to Reading List

        Source URL: nacloweb.org

        Language: English - Date: 2014-08-15 16:08:33
          5PostDoc position (f/m) (100%, 40 hours/week) in the Inverse Problems and Mathematical Imaging Group At the Johann Radon Institute for Computational and Applied Mathematics (RICAM) of the Austrian Academy of Sciences, Lin

          PostDoc position (f/m) (100%, 40 hours/week) in the Inverse Problems and Mathematical Imaging Group At the Johann Radon Institute for Computational and Applied Mathematics (RICAM) of the Austrian Academy of Sciences, Lin

          Add to Reading List

          Source URL: www.ricam.oeaw.ac.at

          Language: English - Date: 2018-05-03 03:11:45
            6Extra Credit! Due December 4th , 5 PM The following computational problems use the inner product space C[−π, π] of all continuous, real-valued functions on [−π, π], together with the inner product Z 1 π

            Extra Credit! Due December 4th , 5 PM The following computational problems use the inner product space C[−π, π] of all continuous, real-valued functions on [−π, π], together with the inner product Z 1 π

            Add to Reading List

            Source URL: people.virginia.edu

            - Date: 2007-11-29 12:39:19
              7Computational Optimization and Applications manuscript No. (will be inserted by the editor) Parallel distributed-memory simplex for large-scale stochastic LP problems Miles Lubin · J. A. Julian Hall ·

              Computational Optimization and Applications manuscript No. (will be inserted by the editor) Parallel distributed-memory simplex for large-scale stochastic LP problems Miles Lubin · J. A. Julian Hall ·

              Add to Reading List

              Source URL: mlubin.github.io

              Language: English - Date: 2018-07-26 21:44:39
                8PhD Positions The Computational Biology research group led by Prof. Mukul Bansal has openings for highly motivated PhD students who wish to work on exciting research problems that are both computationally challenging and

                PhD Positions The Computational Biology research group led by Prof. Mukul Bansal has openings for highly motivated PhD students who wish to work on exciting research problems that are both computationally challenging and

                Add to Reading List

                Source URL: www.engr.uconn.edu

                - Date: 2013-07-24 21:12:38
                  9Dragon Architect: Open Design Problems for Guided Learning in a Creative Computational Thinking Sandbox Game Aaron Bauer  Paul G. Allen School of Computer

                  Dragon Architect: Open Design Problems for Guided Learning in a Creative Computational Thinking Sandbox Game Aaron Bauer Paul G. Allen School of Computer

                  Add to Reading List

                  Source URL: www.ericbutler.net

                  - Date: 2017-06-30 18:46:12
                    10Journal of Machine Learning ResearchSubmitted 8/14; Revised 5/15; Published 4/16 Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and

                    Journal of Machine Learning ResearchSubmitted 8/14; Revised 5/15; Published 4/16 Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and

                    Add to Reading List

                    Source URL: jmlr.org

                    - Date: 2016-04-17 19:06:46