注册 | 登录 | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

AbnerCYH's library [691 articles]

最近录入 AbnerCYH's 文献库:按阅读优先等级排序.
  • 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 computation of market equilibria
    SIGACT News, Vol. 35, No. 4. (December 2004), pp. 23-37.
    by Bruno Codenotti, Sriram Pemmaraju, Kasturi Varadarajan
    posted to game complexity algorithms by AbnerCYH on 2008-06-10 03:59:50 as *****
  • Constructing boosting algorithms from SVMs: an application to one-class classification
    Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 24, No. 9. (September 2002), pp. 1184-1199.
    by G Ratsch, S Mika, B Scholkopf, KR Muller
    posted to optimization kdd algorithms by AbnerCYH on 2008-05-10 08:08:31 as *****
  • 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 *****
  • A Parameterized Algorithm for Protein Structure Alignment
    Journal of Computational Biology, Vol. 14, No. 5. (2007), pp. 564-577.
    by Jinbo Xu, Feng Jiao, Bonnie Berger
    posted to algorithms biology by AbnerCYH on 2008-03-27 16:06:25 as *****
  • Fast and practical indexing and querying of very large graphs
    (2007), pp. 845-856.
    by Silke Tri\ssl, Ulf Leser
    posted to algorithms data_structure graph by AbnerCYH on 2008-01-15 06:54:38 as *****
  • The Discrete Chaos
    American Journal of Mathematics, Vol. 65, No. 2. (1943), pp. 279-298.
    by Norbert Wiener, Aurel Wintner
    posted to dynamics math by AbnerCYH on 2007-12-27 16:37:19 as *****
  • On the strength of comparisons in property testing
    Information and Computation, Vol. 189, No. 1. (25 February 2004), pp. 107-116.
    by Eldar Fischer
    posted to algorithms complexity testing by AbnerCYH on 2007-11-10 12:14:37 as *****
  • Power-law distributions in empirical data
    (7 Jun 2007)
    by Aaron Clauset, Cosma R Shalizi, MEJ Newman
  • Logic, Graphs, and Algorithms
    (2007)
    by Martin Grohe
    posted to algorithms complexity graph logic by AbnerCYH on 2007-09-25 17:10:00 as *****
  • Finding Pathway Structures in Protein Interaction Networks
    Algorithmica, Vol. 48, No. 4. (2007), pp. 363-374.
    by Songjian Lu, Fenghui Zhang, Jianer Chen, Sing-Hoi Sze
    posted to algorithms biology complex by AbnerCYH on 2007-08-13 17:12:35 as ***** along with 1 group CSBBGraphTheory
  • Graph mining: Laws, generators, and algorithms
    ACM Comput. Surv., Vol. 38, No. 1. (2006)
    by Deepayan Chakrabarti, Christos Faloutsos
  • Logspace Optimization Problems and Their Approximability Properties
    Theory of Computing Systems, Vol. 41, No. 2. (2007), pp. 327-350.
    by Till Tantau
    posted to algorithms complexity by AbnerCYH on 2007-07-26 17:41:13 as ***** along with 1 group CSBBGraphTheory
  • Entropy as a fixed point
    Theor. Comput. Sci., Vol. 350, No. 2. (February 2006), pp. 292-324.
    by Keye Martin
  • Motif Search in Graphs: Application to Metabolic Networks
    IEEE/ACM Trans. Comput. Biol. Bioinformatics, Vol. 3, No. 4. (October 2006), pp. 360-368.
    by Vincent Lacroix, Cristina G Fernandes, Marie-France Sagot
  • A homology theory for spanning trees of a graph
    Acta Math. Acad. Sci. Hungar., Vol. 30, No. 3-4. (1977), pp. 241-251.
    by L Lovász
  • Fixed Point Calculus
    (2000)
    by Ronald Backhouse
  • Difference equations
    by Ronald E Mickens
    posted to combinatorics math by AbnerCYH on 2007-09-22 17:57:55 as ****
  • Algorithmic Information Theory: a brief non-technical guide to the field
    Scholarpedia (6 Mar 2007)
    by Marcus Hutter
  • An Algebraic Perspective of Group Relaxations
    (3 Oct 2001)
    by Rekha R Thomas
  • Max-algebra: the linear algebra of combinatorics?
    Linear Algebra and its Applications, Vol. 367 (1 July 2003), pp. 313-335.
    by Peter Butkovic
  • The origins of combinatorics on words
    European Journal of Combinatorics, Vol. 28, No. 3. (April 2007), pp. 996-1022.
    by Jean Berstel, Dominique Perrin
  • Computational Dynamics
    (2001)
    by Ahmed A Shabana
    posted to algorithms dynamics math by AbnerCYH on 2006-11-30 17:34:21 as **** along with 1 group CSBBGraphTheory
  • An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality.
    Bioinformatics (Oxford, England), Vol. 22, No. 24. (15 December 2006), pp. 3106-3108.
    by J Yoon, A Blumer, K Lee
    posted to kdd graph complex biology algorithms by AbnerCYH on 2008-07-01 03:36:10 as *** along with 1 person hryk
  • Data Structures for Range Searching
    ACM Comput. Surv., Vol. 11, No. 4. (December 1979), pp. 397-409.
    by Jon L Bentley, Jerome H Friedman
  • Randomized rounding without solving the linear program
    (1995), pp. 170-178.
    by Neal E Young
    posted to math optimization stochastic by AbnerCYH on 2007-03-27 12:09:18 as *** along with 1 group CSBBGraphTheory
  • Simple image set of linear mappings in a max-min algebra
    Discrete Applied Mathematics, Vol. 155, No. 5. (15 March 2007), pp. 611-622.
    by Martin Gavalec, Jan Plavka
  • Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
    Automata, Languages and Programming (2008), pp. 634-645.
    by Marc Tedder, Derek Corneil, Michel Habib, Christophe Paul
    posted to order graph algorithms by AbnerCYH on 2008-07-18 18:43:02 as **
  • Unraveling Protein Networks with Power Graph Analysis
    PLoS Comput Biol, Vol. 4, No. 7. (11 July 2008), e1000108.
    by Loïc Royer, Matthias Reimann, Bill Andreopoulos, Michael Schroeder
  • Encyclopedia of Algorithms
    (03 July 2008)
    posted to algorithms by AbnerCYH on 2008-07-16 14:37:27 as **
  • Modular decomposition of protein-protein interaction networks.
    Genome Biol, Vol. 5, No. 8. (2004)
    posted to graph biology algorithms by AbnerCYH on 2008-07-15 03:23:42 as ** along with 1 person ezotenko
  • 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 **
  • The algorithmic aspects of the regularity lemma
    Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on (1992), pp. 473-481.
    by N Alon
    posted to graph combinatorics algorithms by AbnerCYH on 2008-07-08 12:35:49 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 **
  • Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
    (2002), pp. 74-83.
    by Béla Csaba, Marek Karpinski, Piotr Krysta
    posted to testing graph complexity combinatorics algorithms by AbnerCYH on 2008-07-06 19:24:02 as **
  • Property testing in hypergraphs and the removal lemma
    (2007), pp. 488-495.
    by V Rödl, M Schacht
    posted to testing graph combinatorics algorithms by AbnerCYH on 2008-07-06 19:23:40 as **
  • Integer and fractional packings of hypergraphs
    Journal of Combinatorial Theory, Series B, Vol. 97, No. 2. (March 2007), pp. 245-268.
    posted to optimization graph algorithms by AbnerCYH on 2008-07-06 19:22:50 as **
  • Testing versus estimation of graph properties
    (2005), pp. 138-146.
    by Eldar Fischer, Ilan Newman
    posted to testing graph combinatorics algorithms by AbnerCYH on 2008-07-06 19:22:35 as **
  • Cluster analysis for gene expression data: a survey
    Knowledge and Data Engineering, IEEE Transactions on, Vol. 16, No. 11. (2004), pp. 1370-1386.
    by Daxin Jiang, Chun Tang, Aidong Zhang
  • An introduction to variable and feature selection
    J. Mach. Learn. Res., Vol. 3 (2003), pp. 1157-1182.
    by Isabelle Guyon, Andr&\#233; Elisseeff
  • Data clustering: a review
    ACM Comput. Surv., Vol. 31, No. 3. (September 1999), pp. 264-323.
    by AK Jain, MN Murty, PJ Flynn
  • 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 **
  • ◇温馨提示◇本页的引用地址为: http://www.citeulike.org/user/AbnerCYH/order/to_read

    Result page: 1 2 3 4 5 6 7 8 9 10 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.