Algorithms

Results: 10964



#Item
611

9th AIMS CONFERENCE – ABSTRACTS 220 Special Session 53: Greedy Algorithms and Tensor Product Representations for High-Dimensional Problems

Add to Reading List

Source URL: www.aimsciences.org

- Date: 2012-06-23 07:34:52
    612

    Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 1st, 2011 Problem Set 3

    Add to Reading List

    Source URL: courses.csail.mit.edu

    - Date: 2011-03-08 12:41:13
      613

      New Lower Bounds for Distributed Graph Algorithms Jukka Suomela Helsinki Institute for Information Technology HIIT Department of Computer Science, University of Helsinki

      Add to Reading List

      Source URL: users.ics.aalto.fi

      - Date: 2013-12-09 16:38:32
        614

        MCS 401 – Computer Algorithms I Spring 2016 Problem Set 3 Lev Reyzin Due: by the beginning of class

        Add to Reading List

        Source URL: homepages.math.uic.edu

        - Date: 2016-02-19 16:01:07
          615

          Algorithms of discrete logarithm in finite fields Razvan Barbulescu To cite this version: Razvan Barbulescu. Algorithms of discrete logarithm in finite fields. Cryptography and Security [cs.CR]. Universit´e de Lorraine,

          Add to Reading List

          Source URL: tel.archives-ouvertes.fr

          - Date: 2016-07-14 20:58:49
            616

            Application of 2D Deconvolution Algorithms to Correct the Chirp-Induced Velocity Bias in Atmospheric Wind-LIDAR Datasets Johannes Bühl, Ronny Engelmann, Albert Ansmann Leibniz Institute for Tropospheric Research Permose

            Add to Reading List

            Source URL: sti.usra.edu

            - Date: 2012-11-07 10:50:37
              617

              Algorithms Definitions and Properties Approach Example Liouvillian Solutions of Irreducible Linear Difference Equations Yongjae Cha

              Add to Reading List

              Source URL: issac2009.kias.re.kr

              - Date: 2009-07-30 00:31:37
                618

                Bounds On Contention Management Algorithms Johannes Schneider1 , Roger Wattenhofer1 Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland Abstract

                Add to Reading List

                Source URL: disco.ethz.ch

                - Date: 2014-09-26 08:36:30
                  619

                  Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph. In some cases, this can be accomplished by adding some sort of locality constraint and c

                  Add to Reading List

                  Source URL: mmds-data.org

                  - Date: 2016-06-23 15:50:48
                    620

                    Commonly Used Distributions • Random number generation algorithms for distributions commonly used by computer systems performance analysts. • Organized alphabetically for reference • For each distribution:

                    Add to Reading List

                    Source URL: www.cs.wustl.edu

                    - Date: 2003-11-17 02:09:24
                      UPDATE