Algorithms

Results: 10964



#Item
731

Natural Algorithms and Influence Systems Bernadette Charron-Bost CNRS, Ecole polytechnique, France March 7th 2014

Add to Reading List

Source URL: www.cri.ensmp.fr

- Date: 2014-04-14 11:22:28
    732

    Algorithms and Data Structures (WS15/16) Example Solutions for Units 29 & 30 Problem 1 In graph theory, an orientation of an undirected graph is an assignment of a direction to each edge, turning the initial graph into a

    Add to Reading List

    Source URL: www-tcs.cs.uni-sb.de

    - Date: 2016-03-23 14:38:31
      733

      COMPUTATIONAL HARMONIC ANALYSIS FOR TENSOR FIELDS ON THE TWO-SPHERE PETER KOSTELEC, DAVID K. MASLEN, DANIEL N. ROCKMORE, AND DENNIS HEALY, JR. Abstract. In this paper we describe algorithms for the numerical computation

      Add to Reading List

      Source URL: www.cs.dartmouth.edu

      - Date: 1999-12-10 11:56:53
        734

        Efficient Merging and Filtering Algorithms for Approximate String Searches Chen Li, Jiaheng Lu, Yiming Lu Department of Computer Science, University of California, Irvine, CA 92697, USA ,

        Add to Reading List

        Source URL: www.ics.uci.edu

        - Date: 2008-05-08 14:17:32
          735

          Algorithms for Power Savings S. Irani, S. Shukla, R. Gupta, TALG ’07 Giorgos Zois Department of Informatics, Athens University of Economics and Business

          Add to Reading List

          Source URL: pages.cs.aueb.gr

          - Date: 2013-09-14 08:14:24
            736

            Algorithms and Data Structures Winter TermExercises for Unit 5 1. Use the Akkra-Bazi Theorem to derive closed form expressions for the following recursively defined functions:

            Add to Reading List

            Source URL: www-tcs.cs.uni-sb.de

            - Date: 2016-03-01 13:21:58
              737

              Algorithms and Data Structures Winter TermExercises for Units 29 & 30 1. Let G = (V, E) be an undirected graph with vertices V = {v1 , . . . , vn }. Give an efficient algorithm that, given a sequence of non-nega

              Add to Reading List

              Source URL: www-tcs.cs.uni-sb.de

              - Date: 2016-03-21 12:46:57
                738

                Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis April 12, 2011 Problem Set 6

                Add to Reading List

                Source URL: courses.csail.mit.edu

                - Date: 2011-05-13 09:50:20
                  739

                  Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis Daniel Kressner∗ Jose E. Roman†

                  Add to Reading List

                  Source URL: sma.epfl.ch

                  - Date: 2013-11-05 04:06:54
                    740

                    Regression using Classification Algorithms Luís Torgo email :

                    Add to Reading List

                    Source URL: www.dcc.fc.up.pt

                      UPDATE