Random

Results: 10533



#Item
381

Negotiating the Nonnegotiable: How to Resolve Your Most Emotionally Charged Conflicts VIKING An imprint of Penguin Random House LLC 375 Hudson Street

Add to Reading List

Source URL: www.danshapiroglobal.com

- Date: 2016-08-02 16:55:04
    382

    PRNG: Pwning Random Number Generators George Argyros∗ Aggelos Kiayias∗† Randomness is a critical security feature of modern web applications. From session identifiers

    Add to Reading List

    Source URL: media.blackhat.com

    - Date: 2012-08-02 14:30:16
      383

      A TCP with Guaranteed Performance in Networks with Dynamic Congestion and Random Wireless Losses Stefan Schmid, Roger Wattenhofer {schmiste, wattenhofer}@tik.ee.ethz.ch Computer Engineering and Networks Laboratory

      Add to Reading List

      Source URL: disco.ethz.ch

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

        Annals of Mathematics, ), 433–464 Cover times for Brownian motion and random walks in two dimensions By Amir Dembo, Yuval Peres, Jay Rosen, and Ofer Zeitouni*

        Add to Reading List

        Source URL: www.math.csi.cuny.edu

        - Date: 2009-05-03 17:58:48
          385

          DPS PR# June 30, 2016 Random Contact Leads to Federal Drug Charges (KETCHIKAN, Alaska) – On June 22, 2016, the U.S. District Attorney’s Office indicted Jason Alto, 20 of

          Add to Reading List

          Source URL: dps.alaska.gov

          - Date: 2016-06-30 20:02:00
            386

            A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu

            Add to Reading List

            Source URL: www.cs.toronto.edu

            - Date: 2008-09-17 15:06:39
              387

              Universality for the Toda algorithm to compute the eigenvalues of a random matrix Percy Deift and Thomas Trogdon0 Courant Institute of Mathematical Sciences New York University 251 Mercer St.

              Add to Reading List

              Source URL: dl.dropboxusercontent.com

                388

                In this talk, I will introduce hinge-loss Markov random fields (HLMRFs), a new kind of probabilistic graphical model that supports scalable collective inference from richly structured data. HL-MRFs unify three different

                Add to Reading List

                Source URL: mmds-data.org

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

                  341 Do . Math. J. DMV Random Matri es and K-Theory for Exa t

                  Add to Reading List

                  Source URL: documenta.sagemath.org

                  - Date: 2014-07-15 07:20:46
                    390

                    IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 12, DECEMBERSignal Recovery From Random Measurements Via Orthogonal Matching Pursuit

                    Add to Reading List

                    Source URL: users.cms.caltech.edu

                    - Date: 2008-02-13 00:22:57
                      UPDATE