Algorithm

Results: 17634



#Item
61RAIRO Operations Research Will be set by the publisher A BRANCH-AND-PRUNE ALGORITHM FOR THE MOLECULAR DISTANCE GEOMETRY PROBLEM

RAIRO Operations Research Will be set by the publisher A BRANCH-AND-PRUNE ALGORITHM FOR THE MOLECULAR DISTANCE GEOMETRY PROBLEM

Add to Reading List

Source URL: www.enseignement.polytechnique.fr

Language: English - Date: 2006-01-29 12:56:51
    62Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering Chong You† Chun-Guang Li∗ Daniel P. Robinson‡ Ren´e Vidal† † Center for Imaging Science, Johns Hopkins University ∗ SICE, Beijin

    Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering Chong You† Chun-Guang Li∗ Daniel P. Robinson‡ Ren´e Vidal† † Center for Imaging Science, Johns Hopkins University ∗ SICE, Beijin

    Add to Reading List

    Source URL: www.vision.jhu.edu

    Language: English - Date: 2016-04-17 22:32:00
      63Southern Africa Fire Network overview Estimation of live fuel moisture content • Implementation of Dr Marta Yebra’s FMC algorithm • Currently running om MODIS

      Southern Africa Fire Network overview Estimation of live fuel moisture content • Implementation of Dr Marta Yebra’s FMC algorithm • Currently running om MODIS

      Add to Reading List

      Source URL: gofc-fire.umd.edu

      Language: English - Date: 2018-04-27 15:56:55
        641 Cellular growth and division in the Gillespie algorithm Ting Lu1 , Dmitri Volfson2,3 , Lev Tsimring2 and Jeff Hasty3 1

        1 Cellular growth and division in the Gillespie algorithm Ting Lu1 , Dmitri Volfson2,3 , Lev Tsimring2 and Jeff Hasty3 1

        Add to Reading List

        Source URL: biocircuits.ucsd.edu

        Language: English - Date: 2013-10-11 13:37:10
          65The Elston-Stewart Algorithm

          The Elston-Stewart Algorithm

          Add to Reading List

          Source URL: genome.sph.umich.edu

          Language: English - Date: 2012-12-05 08:19:32
            66Approximation algorithms An algorithm has approximation ratio r if it outputs solutions with cost such that c/c* ≤ r and c*/c ≤ r where c* is the optimal cost.

            Approximation algorithms An algorithm has approximation ratio r if it outputs solutions with cost such that c/c* ≤ r and c*/c ≤ r where c* is the optimal cost.

            Add to Reading List

            Source URL: www.ccs.neu.edu

            Language: English - Date: 2015-08-12 09:01:08
              67A Polynomial scheduling algorithm for IEEEZigBee cluster tree WSN with one collision domain and period crossing constraint Aasem Ahmad, Zdenˇek Hanz´alek Claire Hanen

              A Polynomial scheduling algorithm for IEEEZigBee cluster tree WSN with one collision domain and period crossing constraint Aasem Ahmad, Zdenˇek Hanz´alek Claire Hanen

              Add to Reading List

              Source URL: rtime.felk.cvut.cz

              Language: English - Date: 2015-11-27 06:42:24
                68An O(NP) Sequence Comparison Algorithm Sun Wu, Udi Manber1, Gene Myers2, Department of Computer Science University of Arizona Tucson, AZ 85721

                An O(NP) Sequence Comparison Algorithm Sun Wu, Udi Manber1, Gene Myers2, Department of Computer Science University of Arizona Tucson, AZ 85721

                Add to Reading List

                Source URL: myerslab.mpi-cbg.de

                Language: English - Date: 2014-06-19 05:30:01
                  69NLP Programming Tutorial 3 – The Perceptron Algorithm NLP Programming Tutorial 3 The Perceptron Algorithm Graham Neubig Nara Institute of Science and Technology (NAIST)

                  NLP Programming Tutorial 3 – The Perceptron Algorithm NLP Programming Tutorial 3 The Perceptron Algorithm Graham Neubig Nara Institute of Science and Technology (NAIST)

                  Add to Reading List

                  Source URL: www.phontron.com

                  Language: English - Date: 2015-06-29 21:42:32
                    70A Simplex-like Algorithm for Fisher Markets Bharat Adsul1 , Ch. Sobhan Babu2 , Jugal Garg1 , Ruta Mehta1 , and Milind Sohoni1 1 Indian Institute of Technology, Bombay

                    A Simplex-like Algorithm for Fisher Markets Bharat Adsul1 , Ch. Sobhan Babu2 , Jugal Garg1 , Ruta Mehta1 , and Milind Sohoni1 1 Indian Institute of Technology, Bombay

                    Add to Reading List

                    Source URL: jugal.ise.illinois.edu

                    Language: English - Date: 2016-08-01 22:39:12