Random sequence

Results: 148



#Item
1V. G. VOVK  ON A CRITERION OF RANDOMNESS (Communicated by Academician A. N. Kolmogorov, This work belongs to algorithmic information theory (seeTheorem 1 shows that if some sequence is random with resp

V. G. VOVK ON A CRITERION OF RANDOMNESS (Communicated by Academician A. N. Kolmogorov, This work belongs to algorithmic information theory (seeTheorem 1 shows that if some sequence is random with resp

Add to Reading List

Source URL: www.vovk.net

Language: English - Date: 2009-01-29 05:02:58
    2Lecture notes on Spatial Random Permutations Ron Peled∗ June 7, 2015 Abstract These notes accompany a sequence of lectures given at the Warsaw Probability

    Lecture notes on Spatial Random Permutations Ron Peled∗ June 7, 2015 Abstract These notes accompany a sequence of lectures given at the Warsaw Probability

    Add to Reading List

    Source URL: www.math.tau.ac.il

    Language: English - Date: 2015-06-07 09:01:18
      3Percolation and Random Walks on Graphs, MichaelmasExample Sheet 1 1. Let (an )n≥1 be a sequence of real numbers satisfying an+m ≤ an + am for all n, m ≥ 1.

      Percolation and Random Walks on Graphs, MichaelmasExample Sheet 1 1. Let (an )n≥1 be a sequence of real numbers satisfying an+m ≤ an + am for all n, m ≥ 1.

      Add to Reading List

      Source URL: www.statslab.cam.ac.uk

      Language: English - Date: 2017-10-30 05:12:44
        4Text-line Random Shuffling Program David R. Musser April 25, 2005 Abstract This short document presents a program that takes as input any sequence of items formatted one item per line and outputs the sequence

        Text-line Random Shuffling Program David R. Musser April 25, 2005 Abstract This short document presents a program that takes as input any sequence of items formatted one item per line and outputs the sequence

        Add to Reading List

        Source URL: www.literateprogramming.com

        Language: English - Date: 2007-10-09 02:24:48
          5Synthesizing Manipulation Sequences for Under-Specified Tasks using Unrolled Markov Random Fields Jaeyong Sung, Bart Selman and Ashutosh Saxena Abstract— Many tasks in human environments require performing a sequence o

          Synthesizing Manipulation Sequences for Under-Specified Tasks using Unrolled Markov Random Fields Jaeyong Sung, Bart Selman and Ashutosh Saxena Abstract— Many tasks in human environments require performing a sequence o

          Add to Reading List

          Source URL: pr.cs.cornell.edu

          - Date: 2014-06-22 00:06:22
            6The scaling window for a random graph with a given degree sequence Hamed Hatami and Michael Molloy∗ Department of Computer Science University of Toronto e-mail: ,

            The scaling window for a random graph with a given degree sequence Hamed Hatami and Michael Molloy∗ Department of Computer Science University of Toronto e-mail: ,

            Add to Reading List

            Source URL: www.cs.toronto.edu

            - Date: 2009-10-12 22:30:06
              7CrossMark_Color_Stacked_p

              CrossMark_Color_Stacked_p

              Add to Reading List

              Source URL: debut.cis.nctu.edu.tw

              Language: English - Date: 2014-08-15 02:06:04
              8Powerpoint-presentation Information and Computing Sciences

              Powerpoint-presentation Information and Computing Sciences

              Add to Reading List

              Source URL: usefulpatterns.org

              Language: English - Date: 2015-04-25 08:23:03
              9From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries [Extended Abstract] Chung-Min Chen

              From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries [Extended Abstract] Chung-Min Chen

              Add to Reading List

              Source URL: www.cs.uwm.edu

              Language: English - Date: 2002-03-01 16:04:01
              10Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton Scott Aaronson∗ Sean M. Carroll†

              Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton Scott Aaronson∗ Sean M. Carroll†

              Add to Reading List

              Source URL: www.scottaaronson.com

              Language: English - Date: 2014-05-27 14:31:46