„Random graph“

Suchergebnisse

1.427 Treffer

• Disease gene identification by using graph kernels and Markov random fields
  Chen, Bolin ; Li, Min ; Wang, Jianxin ; Wu, Fang-Xiang
• A Detailed Investigation into Near Degenerate Exponential Random Graphs
  Yin, Mei
• Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation – In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman
  Goldreich, Oded 2011 Springer Berlin Heidelberg
• Graph lattice: random walk and combinatorial identities
  Erusalimskiy, I. M.
• Independence numbers of random subgraphs of distance graphs
  Pyaderkin, M. M.
• Approximation, randomization, and combinatorial optimization – algorithms and techniques ; proceedings
  Goldberg, Leslie Ann ; Jansen, Klaus ; Ravi, Ramamoorthi ; Rolim, José D.P. 2011 Springer
• Studies in complexity and cryptography – miscellanea on the interplay between randomness and computation
  Goldreich, Oded 2011 Springer
• Synchronization and symmetry breaking in distributed systems
  Lenzen, Christoph 2011 Hartung-Gorre
• A Limit Theorem for Scaled Eigenvectors of Random Dot Product Graphs
  Athreya, A. ; Priebe, C. E. ; Tang, M. ; Lyzinski, V. ; Marchette, D. J. ; Sussman, D. L.
• Random Walks and Diffusions on Graphs and Databases – An Introduction
  Blanchard, Philippe ; Volchenkov, Dimitri 2011 Springer Berlin Heidelberg
• Automata, languages and programming
  2011 Springer
• Random feature weights for regression trees
  Arnaiz-González, Álvar ; Díez-Pastor, José F. ; García-Osorio, César ; Rodríguez, Juan J.
• Random extreme learning machines to predict electric load in buildings
  Vergara, Gonzalo ; Alonso-Barba, Juan I. ; Soria-Olivas, Emilio ; Gámez, José A. ; Dominguez, Manuel
• Percolation with Small Clusters on Random Graphs
  Rahman, Mustazee
• Hybrid Random Fields – A Scalable Approach to Structure and Parameter Learning in Probabilistic Graphical Models
  Freno, Antonino ; Trentin, Edmondo 2011 Springer Berlin Heidelberg
• Hybrid random fields – a scalable approach to structure and parameter learning in probabilistic graphical models
  Freno, Antonino ; Trentin, Edmondo 2011 Springer
• Random walks, disconnection and random interlacements – A dissertation submitted to ETH Zurich
  Windisch, David 2010 Suedwestdeutscher Verlag fuer Hochschulschriften
• Random walks and diffusions on graphs and databases – an introduction
  Blanchard, Philippe ; Volchenkov, Dimitri 2011 Springer
• Linking number and writhe in random linear embeddings of graphs
  Flapan, Erica ; Kozai, Kenji
• Maximal assortative matching for real-world network graphs, random network graphs and scale-free network graphs
  Meghanathan, Natarajan