S'inscrire | Se connecter | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

de AbnerCYH library [698 articles]

Articles dernièrement stockés dans la bibliothèque de AbnerCYH .
  • Molecular interaction maps of bioregulatory networks: a general rubric for systems biology.
    Mol Biol Cell, Vol. 17, No. 1. (January 2006), pp. 1-13.
    by KW Kohn, MI Aladjem, JN Weinstein, Y Pommier
  • Decomposition of overlapping protein complexes: A graph theoretical method for analyzing static and dynamic protein associations
    Algorithms for Molecular Biology, Vol. 1, No. 1. (26 April 2006), 7.
    by Elena Zotenko, Katia S Guimarães, Raja Jothi, Teresa M Przytycka
  • Charting protein complexes, signaling pathways, and networks in the immune system
    Immunological Reviews, Vol. 210, No. 1. (April 2006), pp. 187-207.
    posted to graph complex biology algorithms by AbnerCYH on 2008-07-19 19:15:14 as **
  • Evaluation of clustering algorithms for protein-protein interaction networks
    BMC Bioinformatics, Vol. 7 (06 November 2006), 488.
    by Sylvain Brohee, Jacques van Helden
  • Iterative Cluster Analysis of Protein Interaction Data
    Bioinformatics, Vol. 21, No. 3. (01 February 2005), 364.
    by Vicente Arnau, Sergio Mars, Ignacio Marin
    posted to kdd graph complex biology algorithms by AbnerCYH on 2008-07-19 19:14:42 as ** along with 2 people mdimmic tny
  • Discovery of biological networks from diverse functional genomic data.
    Genome Biol, Vol. 6, No. 13. (2005)
    posted to graph complex biology algorithms by AbnerCYH on 2008-07-19 19:14:28 as ** along with 2 people carlk grahamc
  • On the complexity of deriving position specific score matrices from positive and negative sequences
    Discrete Applied Mathematics, Vol. 155, No. 6-7. (1 April 2007), pp. 676-685.
    by Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
    posted to complexity biology algorithms by AbnerCYH on 2008-07-19 09:18:35 as **
  • 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 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 **
  • On minimum -connected k -dominating set problem in unit disc graphs
    Journal of Combinatorial Optimization, Vol. 16, No. 2. (2008), pp. 99-106.
    by Weiping Shang, Frances Yao, Pengjun Wan, Xiaodong Hu
    posted to graph algorithms by AbnerCYH on 2008-07-05 08:09:32 as **
  • The Computational Complexity of Link Building
    Computing and Combinatorics (2008), pp. 119-129.
    by Martin Olsen
    posted to kdd complexity by AbnerCYH on 2008-07-04 11:56:16 as **
  • Quasi-bicliques: Complexity and Binding Pairs
    Computing and Combinatorics (2008), pp. 255-264.
    by Xiaowen Liu, Jinyan Li, Lusheng Wang
    posted to graph complexity algorithms by AbnerCYH on 2008-07-04 11:00:06 as **
  • Spreading Messages
    Computing and Combinatorics (2008), pp. 587-599.
    by Ching-Lueh Chang, Yuh-Dauh Lyuu
    posted to graph algorithms by AbnerCYH on 2008-07-04 10:42:22 as **
  • Optimal Insertion of a Segment Highway in a City Metric
    Computing and Combinatorics (2008), pp. 611-620.
    by Matias Korman, Takeshi Tokuyama
    posted to graph geometries algorithms by AbnerCYH on 2008-07-04 10:42:16 as **
  • Transcription factor modularity in a gene-centered C. elegans core neuronal protein-DNA interaction network
    Genome Res., Vol. 17, No. 7. (1 July 2007), pp. 1061-1071.
    by Vanessa Vermeirssen, Inmaculada M Barrasa, Cesar A Hidalgo, Jenny A Babon, Reynaldo Sequerra, Lynn Doucette-Stamm, Albert-Laszlo Barabasi, Albertha J Walhout
    posted to kdd graph complex biology by AbnerCYH on 2008-07-03 20:20:30 as **
  • Epidemic dynamics and endemic states in complex networks
    Physical Review E, Vol. 63, No. 6. (22 May 2001), 066117.
    by Romualdo Pastor-Satorras, Alessandro Vespignani
    posted to graph dynamics complex biology by AbnerCYH on 2008-07-03 19:28:36 as **
  • Epidemic Spreading in Scale-Free Networks
    Physical Review Letters, Vol. 86, No. 14. (2 April 2001), 3200.
    by Romualdo Pastor-Satorras, Alessandro Vespignani
    posted to graph dynamics complex biology by AbnerCYH on 2008-07-03 19:28:17 as ** along with 1 person rcrane
  • 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 **
  • Identification of Functional Information Subgraphs in Complex Networks
    Physical Review Letters, Vol. 100, No. 23. (2008)
    by Lu\is MA Bettencourt, Vadas Gintautas, Michael I Ham
  • Davenport-Schinzel Sequences and their Geometric Applications
    (1998)
    by Micha Sharir, Pankaj K Agarwal
    posted to geometries combinatorics by AbnerCYH on 2008-07-02 15:09:20 as **
  • Approximation schemes for a class of subset selection problems
    Theoretical Computer Science, Vol. 382, No. 2. (31 August 2007), pp. 151-156.
    by Kirk Pruhs, Gerhard J Woeginger
    posted to optimization combinatorics algorithms by AbnerCYH on 2008-07-01 19:38:55 as **
  • 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
  • Boosting Support Vector Machines for Imbalanced Data Sets
    Foundations of Intelligent Systems (2008), pp. 38-47.
    by Benjamin Wang, Nathalie Japkowicz
    posted to optimization kdd algorithms by AbnerCYH on 2008-06-30 17:55:43 as **
  • Coherent closed quasi-clique discovery from large dense graph databases
    (2006), pp. 797-802.
    by Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Karypis
    posted to kdd graph algorithms by AbnerCYH on 2008-06-30 17:42:22 as **
  • A study of the behavior of several methods for balancing machine learning training data
    SIGKDD Explor. Newsl., Vol. 6, No. 1. (June 2004), pp. 20-29.
    by Gustavo EAPA Batista, Ronaldo C Prati, Maria C Monard
    posted to kdd algorithms by AbnerCYH on 2008-06-30 17:38:46 as **
  • Learning from imbalanced data sets with boosting and data generation: the DataBoost-IM approach
    SIGKDD Explor. Newsl., Vol. 6, No. 1. (June 2004), pp. 30-39.
    by Hongyu Guo, Herna L Viktor
    posted to kdd algorithms by AbnerCYH on 2008-06-30 17:37:23 as **
  • Analysis of Linear Time Sorting Algorithms
    The Computer Journal, Vol. 51, No. 4. (1 July 2008), pp. 451-469.
    by Paul M Shutler, Seok W Sim, Wei Y Lim
    posted to sys_performance algorithms by AbnerCYH on 2008-06-30 16:05:54 as **
  • Remarque: pour citer cette page, utilisez l'url suivante: http://www.citeulike.org/user/AbnerCYH

    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.