Registrati | Log in | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

di AbnerCYH library [672 articles]

Articoli aggiunti di recente nella biblioteca di AbnerCYH .
  • 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
    posted to testing stochastic graph combinatorics algorithms by AbnerCYH on 2008-07-05 14:09:51 as ** along with 1 person bfraser
  • 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.
    by Y Kohayakawa, V Rödl, L Thoma
    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
    posted to graph complex algorithms by AbnerCYH on 2008-07-03 13:58:51 as ** along with 2 people rsantana stringertheory
  • 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 **
  • An Empirical Comparison of Three Boosting Algorithms on Real Data Sets with Artificial Class Noise
    Multiple Classifier Systems (2003), pp. 161-161.
    by Ross Mcdonald, David Hand, Idris Eckley
    posted to sys_performance kdd algorithms by AbnerCYH on 2008-06-30 15:18:37 as **
  • A computational analysis of the protein-protein interaction networks in neurodegenerative diseases
    BMC Systems Biology, Vol. 2, No. 1. (2008)
    by Joaquin Goni, Francisco Esteban, Nieves V de Mendizabal, Jorge Sepulcre, Sergio A Treijano, Ion Agirrezabal, Pablo Villoslada
    posted to kdd graph complex biology algorithms by AbnerCYH on 2008-06-27 05:29:43 as ** along with 3 people reyez renatomilani bootsy
  • The complexity of Tarski's fixed point theorem
    Theoretical Computer Science, Vol. 401, No. 1-3. (23 July 2008), pp. 228-235.
    by Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti
    posted to topology math complexity by AbnerCYH on 2008-06-26 10:51:13 as **
  • An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization
    Machine Learning, Vol. 40, No. 2. (2000), pp. 139-157.
    by Thomas G Dietterich
    posted to sys_performance kdd algorithms by AbnerCYH on 2008-06-26 10:40:41 as **
  • Improved Boosting Algorithms Using Confidence-rated Predictions
    Mach. Learn., Vol. 37, No. 3. (December 1999), pp. 297-336.
    by Robert E Schapire, Yoram Singer
    posted to kdd algorithms by AbnerCYH on 2008-06-26 10:38:43 as ** along with 3 people quam vlachmore bbabenko
  • Modular cell biology: retroactivity and insulation
    Mol Syst Biol, Vol. 4 (12 February 2008)
    by Domitilla Del Vecchio, Alexander J Ninfa, Eduardo D Sontag
    posted to graph complex biology by AbnerCYH on 2008-06-26 03:48:59 as ** along with 5 people roys austin margaritis rsantana pmendes
  • Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
    SIAM Journal on Computing, Vol. 29, No. 5. (2000), pp. 1449-1483.
    by Michael Saks, Fotios Zaharoglou
    posted to topology graph algorithms by AbnerCYH on 2008-06-20 11:58:17 as **
  • Relativizations of the $\mathcalP = ?\mathcalNP$ Question
    SIAM Journal on Computing, Vol. 4, No. 4. (1975), pp. 431-442.
    by Theodore Baker, John Gill, Robert Solovay
    posted to complexity by AbnerCYH on 2008-06-20 09:38:03 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 **
  • 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 *****
  • Primal-dual approximation algorithms for integral flow and multicut in trees
    Algorithmica, Vol. 18, No. 1. (6 May 1997), pp. 3-20.
    by N Garg, V Vazirani, M Yannakakis
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 12:47:42 as **
  • On the complexity of minmax regret linear programming
    European Journal of Operational Research, Vol. 160, No. 1. (1 January 2005), pp. 227-231.
    by Igor Averbakh, Vasilij Lebedev
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 10:25:47 as **
  • Complexity of the min-max and min-max regret assignment problems
    Operations Research Letters, Vol. 33, No. 6. (November 2005), pp. 634-640.
    by Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 09:41:46 as **
  • A note on the minmax regret centdian location on trees
    Operations Research Letters, Vol. 36, No. 2. (March 2008), pp. 271-275.
    by Eduardo Conde
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 09:37:34 as **
  • Complexity of robust single facility location problems on networks with uncertain edge lengths
    Discrete Applied Mathematics, Vol. 127, No. 3. (1 May 2003), pp. 505-522.
    by Igor Averbakh
    posted to graph complexity automata by AbnerCYH on 2008-06-09 08:50:40 as **
  • Generalized multidimensional data mapping and query processing
    ACM Trans. Database Syst., Vol. 30, No. 3. (September 2005), pp. 661-697.
    by Rui Zhang, Panos Kalnis, Beng C Ooi, Kian-Lee Tan
    posted to graph geometries data_structure algorithms by AbnerCYH on 2008-06-06 05:27:39 as **
  • Efficient query processing on spatial networks
    (2005), pp. 200-209.
    by Jagan Sankaranarayanan, Houman Alborzi, Hanan Samet
    posted to graph geometries data_structure algorithms by AbnerCYH on 2008-06-06 05:27:25 as **
  • Distance join queries on spatial networks
    (2006), pp. 211-218.
    by Jagan Sankaranarayanan, Houman Alborzi, Hanan Samet
    posted to graph geometries data_structure algorithms by AbnerCYH on 2008-06-06 05:27:06 as **
  • Ranking in Spatial Databases
    (1995), pp. 83-95.
    by Gisli R Hjaltason, Hanan Samet
    posted to geometries data_structure algorithms by AbnerCYH on 2008-06-06 05:26:37 as ** along with 1 person sunandap
  • The strength of weak learnability
    Machine Learning, Vol. 5, No. 2. (1 June 1990), pp. 197-227.
    by Robert E Schapire
    posted to kdd complexity algorithms by AbnerCYH on 2008-06-03 03:08:47 as **
  • Shellable Nonpure Complexes and Posets. II
    Vol. 349, No. 10. (October 1997), pp. 3945-3975.
    by Anders Bjorner, Michelle L Wachs
    posted to topology order combinatorics algebra by AbnerCYH on 2008-05-27 09:00:39 as **
  • Shellable Nonpure Complexes and Posets. I
    Transactions of the American Mathematical Society, Vol. 348, No. 4. (April 1996), pp. 1299-1367.
    by Anders Bjorner, Michelle L Wachs
    posted to topology order combinatorics algebra by AbnerCYH on 2008-05-27 08:58:33 as **
  • Fast Network Component Analysis (FastNCA) for gene regulatory network reconstruction from microarray data.
    Bioinformatics (Oxford, England) (9 April 2008)
    by Chunqi Chang, Zhi Ding, Yeung Sam S Hung, Peter Chin Wan C Fung
    posted to graph complex biology algorithms by AbnerCYH on 2008-05-24 12:01:59 as ** along with 3 people jfr roys jyuh
  • Nonlinearity Of Davenport-Schinzel Sequences And Of A Generalized Path Compression Scheme
    Foundations of Computer Science, 1984. 25th Annual Symposium on (1984), pp. 313-319.
    by S Hart, M Sharir
    posted to data_structure algorithms by AbnerCYH on 2008-05-24 06:01:49 as **
  • Splay trees, Davenport-Schinzel sequences, and the deque conjecture
    (2008), pp. 1115-1124.
    by Seth Pettie
    posted to data_structure combinatorics by AbnerCYH on 2008-05-24 06:01:42 as **
    • Puoi citare questa pagina come: 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.