新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

AbnerCYH stochastic [70 articles]

最近 AbnerCYH さんのライブラリに追加された論文の中から タグ stochastic. You can also see everyone's stochastic.
  • An optimal algorithm for checking regularity: (extended abstract)
    (2002), pp. 277-286.
    posted to testing stochastic combinatorics algorithms by AbnerCYH on 2008-07-10 17:00:34 as **
  • Small subsets inherit sparse $ε$-regularity
    J. Comb. Theory Ser. B, Vol. 97, No. 1. (January 2007), pp. 34-56.
    by Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger
    posted to stochastic combinatorics by AbnerCYH on 2008-07-06 19:26:38 as **
  • The Turán Theorem for Random Graphs
    Comb. Probab. Comput., Vol. 13, No. 1. (January 2004), pp. 61-91.
    by Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht
    posted to stochastic graph combinatorics by AbnerCYH on 2008-07-06 19:26:23 as **
  • Regular pairs in sparse random graphs I
    Random Struct. Algorithms, Vol. 22, No. 4. (July 2003), pp. 359-434.
    posted to stochastic graph combinatorics by AbnerCYH on 2008-07-06 19:26:15 as **
  • The Blow-up Lemma
    Comb. Probab. Comput., Vol. 8, No. 1-2. (1999), pp. 161-176.
    by János Komlós
    posted to stochastic combinatorics by AbnerCYH on 2008-07-06 19:24:47 as **
  • Hypergraphs, quasi-randomness, and conditions for regularity
    J. Comb. Theory Ser. A, Vol. 97, No. 2. (February 2002), pp. 307-352.
    by Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan
    posted to stochastic graph combinatorics by AbnerCYH on 2008-07-06 19:24:37 as **
  • Fast monte-carlo algorithms for finding low-rank approximations
    J. ACM, Vol. 51, No. 6. (November 2004), pp. 1025-1041.
    by Alan Frieze, Ravi Kannan, Santosh Vempala
    posted to stochastic optimization math algorithms by AbnerCYH on 2008-07-06 19:24:23 as **
  • The algorithmic aspects of the regularity lemma
    J. Algorithms, Vol. 16, No. 1. (January 1994), pp. 80-109.
    by N Alon, RA Duke, H Lefmann, V R&\#246;dl, R Yuster
  • The regularity lemma and approximation schemes for dense problems
    (1996)
    by A Frieze
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:09:49 as **
  • Property testing and its connection to learning and approximation
    J. ACM, Vol. 45, No. 4. (July 1998), pp. 653-750.
    by Oded Goldreich, Shari Goldwasser, Dana Ron
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:09:45 as **
  • On characterizing hypergraph regularity
    Random Struct. Algorithms, Vol. 21, No. 3-4. (2002), pp. 293-335.
    by Y Dementieva, PE Haxell, B Nagle, V Rödl
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:09:28 as **
  • An optimal algorithm for checking regularity: (extended abstract)
    (2002), pp. 277-286.
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:08:58 as **
  • Hardness of fully dense problems
    Inf. Comput., Vol. 205, No. 8. (August 2007), pp. 1117-1129.
    by Nir Ailon, Noga Alon
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:08:27 as **
  • The Regularity Lemma and Its Applications in Graph Theory
    Theoretical Aspects of Computer Science (2002), pp. 149-152.
    by János Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-03 14:26:39 as **
  • Hardness Hypotheses, Derandomization, and Circuit Complexity
    Computational Complexity, Vol. 17, No. 1. (6 April 2008), pp. 119-146.
    by John Hitchcock, A Pavan
    posted to stochastic complexity by AbnerCYH on 2008-06-10 04:05:57 as **
  • Space Complexity Vs. Query Complexity
    Computational Complexity, Vol. 17, No. 1. (6 April 2008), pp. 70-93.
    by Oded Lachish, Ilan Newman, Asaf Shapira
    posted to testing stochastic complexity by AbnerCYH on 2008-06-10 04:04:58 as **
  • A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting,
    Journal of Computer and System Sciences, Vol. 55, No. 1. (August 1997), pp. 119-139.
    by Yoav Freund, Robert E Schapire
    posted to stochastic math kdd algorithms by AbnerCYH on 2008-05-15 02:40:34 as **
  • Complex networks: Lies, damned lies and statistics
    Nat Phys, Vol. 2, No. 2. (February 2006), pp. 75-76.
    by Nunes, Roger Guimera
  • The support vector machine under test
    Neurocomputing, Vol. 55, No. 1-2. (September 2003), pp. 169-186.
    by David Meyer, Friedrich Leisch, Kurt Hornik
    posted to stochastic optimization kdd algorithms algebra by AbnerCYH on 2008-05-09 21:39:06 as *****
  • The boosting approach to machine learning: An overview
    (2001)
  • An introduction to ROC analysis
    Pattern Recognition Letters, Vol. 27, No. 8. (June 2006), pp. 861-874.
    by Tom Fawcett
  • Using AUC and accuracy in evaluating learning algorithms
    Knowledge and Data Engineering, IEEE Transactions on, Vol. 17, No. 3. (2005), pp. 299-310.
    by Jin Huang, CX Ling
    posted to stochastic kdd information algorithms by AbnerCYH on 2008-05-09 13:02:22 as **
  • Analyzing Receiver Operating Characteristic Curves With SAS (Sas Press Series) (Sas Press Series)
    (10 October 2007)
    by Mithat Gonen
    posted to stochastic math by AbnerCYH on 2008-05-09 12:47:52 as **
  • The use of receiver operating characteristic curves in biomedical informatics
    Journal of Biomedical Informatics, Vol. 38, No. 5. (October 2005), pp. 404-415.
    by Thomas A Lasko, Jui G Bhagwat, Kelly H Zou, Lucila Ohno-Machado
  • Statistical Learning Theory
    (16 September 1998)
    by Vladimir N Vapnik
  • Geometric Discrepancy: An Illustrated Guide (Algorithms and Combinatorics)
    (15 July 1999)
    by Jiri Matousek
    posted to algorithms combinatorics geometries order stochastic by AbnerCYH on 2008-04-16 03:19:46 as **
  • An Introduction to Computational Learning Theory
    (15 August 1994)
    by Michael J Kearns, Umesh V Vazirani
  • A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
    SIAM J. Comput., Vol. 31, No. 6. (2002), pp. 1879-1895.
    by Seth Pettie, Vijaya Ramachandran
    posted to algorithms graph parallel stochastic by AbnerCYH on 2008-04-03 12:02:00 as **
  • Closed-loop control of cellular functions using combinatory drugs guided by a stochastic search algorithm
    Proceedings of the National Academy of Sciences, Vol. 105, No. 13. (1 April 2008), pp. 5105-5110.
    by Pak K Wong, Fuqu Yu, Arash Shahangian, Genhong Cheng, Ren Sun, Chih-Ming Ho
    posted to algorithms biology complex stochastic by AbnerCYH on 2008-04-02 01:15:45 as **
  • A theory of the learnable
    Commun. ACM, Vol. 27, No. 11. (November 1984), pp. 1134-1142.
    by LG Valiant
  • The small-world phenomenon: an algorithm perspective
    (2000), pp. 163-170.
    by Jon Kleinberg
  • The Web as a Graph
    (JanuaryMay--JanuaryJuly~ 2000), pp. 1-10.
    by Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D Sivakumar, Andrew Tomkins, Eli Upfal
  • Counting, Sampling and Integrating: Algorithms and Complexity (Lectures in Mathematics. ETH Zürich)
    (28 April 2003)
    by Mark Jerrum
    posted to algorithms math stochastic by AbnerCYH on 2008-03-15 17:25:19 as ** along with 1 person lcigler
  • Could any graph be turned into a small-world?
    Theoretical Computer Science, Vol. 355, No. 1. (6 April 2006), pp. 96-103.
    by Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
  • Aspects of discrete mathematics and probability in the theory of machine learning
    Discrete Applied Mathematics, Vol. 156, No. 6. (15 March 2008), pp. 883-902.
    by Martin Anthony
  • On the testability and repair of hereditary hypergraph properties
    (14 Jan 2008)
    by Tim Austin, Terence Tao
  • Getting Started in Probabilistic Graphical Models
    PLoS Computational Biology, Vol. 3, No. 12. (1 December 2007), e252.
    by Edoardo M Airoldi
  • An information-theoretic framework for resolving community structure in complex networks
    PNAS, Vol. 104, No. 18. (1 May 2007), pp. 7327-7331.
    by Martin Rosvall, Carl T Bergstrom
  • The mutual information: Detecting and evaluating dependencies between variables
    Bioinformatics, Vol. 18 (2002), pp. S231-S240.
    by R Steuer, J Kurths, CO Daub, J Weise, J Selbig
    posted to biology information math stochastic testing by AbnerCYH on 2007-11-26 13:37:16 as **
  • The Strength of Weak Ties: A Network Theory Revisited
    Sociological Theory, Vol. 1 (1983), pp. 201-233.
    by Mark Granovetter
  • The Strength of Weak Ties
    The American Journal of Sociology, Vol. 78, No. 6. (1973), pp. 1360-1380.
    by Mark S Granovetter
  • Empirical Analysis of an Evolving Social Network
    Science, Vol. 311, No. 5757. (6 January 2006), pp. 88-90.
    by Gueorgi Kossinets, Duncan J Watts
  • Power-law distributions in empirical data
    (7 Jun 2007)
    by Aaron Clauset, Cosma R Shalizi, MEJ Newman
  • Characterization of complex networks: A survey of measurements
    (30 Jun 2005)
    by Luciano, Francisco A Rodrigues, Gonzalo Travieso, Villas PR Boas
  • Products and Help Bits in Decision Trees
    SIAM Journal on Computing, Vol. 28, No. 3. (1998), pp. 1035-1050.
    by Noam Nisan, Steven Rudich, Michael Saks
    posted to algorithms complexity order stochastic by AbnerCYH on 2007-10-23 10:16:14 as **
  • Time-space trade-off lower bounds for randomized computation of decision problems
    J. ACM, Vol. 50, No. 2. (March 2003), pp. 154-195.
    by Paul Beame, Michael Saks, Xiaodong Sun, Erik Vee
    posted to algorithms complexity stochastic by AbnerCYH on 2007-10-23 10:11:19 as ** along with 1 person BarrosH
  • Sharpening the LYM inequality
    Combinatorica, Vol. 12, No. 3. (1992), pp. 287-293.
    by Péter L Erdős, P Frankl, DJ Kleitman, ME Saks, LA Székely
    posted to combinatorics stochastic by AbnerCYH on 2007-10-19 15:23:45 as **
  • Prisoner's dilemma and clusters on small-world networks
    Complexity, Vol. 12, No. 6. (2007), pp. 22-36.
    by Xavier Thibert-Plante, Lael Parrott
    posted to algorithms graph stochastic by AbnerCYH on 2007-10-12 11:49:06 as **
  • A combinatorial approach to correlation inequalities
    Discrete Mathematics, Vol. 257, No. 2-3. (28 November 2002), pp. 311-327.
    by Graham R Brightwell, William T Trotter
    posted to combinatorics math order stochastic by AbnerCYH on 2007-10-09 08:22:45 as **
  • On Random Intersection Graphs: The Subgraph Problem
    Comb. Probab. Comput., Vol. 8, No. 1-2. (1999), pp. 131-159.
    by Micha\l Karonski, Edward R Scheinerman, Karen B Singer-Cohen
    posted to algorithms graph order stochastic by AbnerCYH on 2007-10-08 19:09:33 as **
  • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/AbnerCYH/tag/stochastic

    Result page: 1 2 Next RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.