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

AbnerCYH's algorithms [471 articles]

当前文献位于 AbnerCYH's 文献库 标签分类为 algorithms. You can also see everyone's algorithms.
  • 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.
    by V Rödl, M Schacht, MH Siggers, N Tokushige
    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
    posted to kdd biology algorithms by AbnerCYH on 2008-07-06 07:29:57 as ** along with 4 people burtonwu bayesian archroad dps
  • An introduction to variable and feature selection
    J. Mach. Learn. Res., Vol. 3 (2003), pp. 1157-1182.
    by Isabelle Guyon, Andr&\#233; Elisseeff
    posted to kdd algorithms by AbnerCYH on 2008-07-06 07:27:17 as ** along with 15 people amargoli yaroslavvb bigga sona JoSeK davidr gyuli buescher76 mukundn student_t chiahuey gkvas Mohan-S dimatura gabriprat
  • Data clustering: a review
    ACM Comput. Surv., Vol. 31, No. 3. (September 1999), pp. 264-323.
    by AK Jain, MN Murty, PJ Flynn
    posted to kdd geometries algorithms by AbnerCYH on 2008-07-06 07:25:09 as ** along with 40 people and 14 groups mercutio egh ericyu karbak dgruiz pdlug thsant mapio mhay davidbrooks imouthesmp dfrankow rahul marcius stagediver sterovetta sangeetha chadhogg sdvillal dgront styliani alexhofmann gane5h ianturton bigbossman perceptron allmensch aviad_work julianpan atbrew sugarexpletive KillianKay mkolar sajan dvisoin theodora jcsilva furykerry koles paulovn video_retrieval kdl GroupLens Bioinformatics SRL insilicodrug BioinfoCIPF SGU-CIPF MScResearchRessources NDSiTransitRessources NDS106ProjectRessources NDSIntraVehicularResearch ahat Community_SSTZ
  • 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 **
  • 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 **
  • 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
  • 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
  • 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
  • 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 **
  • 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 **
  • 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 **
  • 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 **
  • A class of algorithms which require nonlinear time to maintain disjoint sets
    Journal of Computer and System Sciences, Vol. 18, No. 2. (April 1979), pp. 110-127.
    by Robert E Tarjan
    posted to graph algorithms by AbnerCYH on 2008-05-20 10:57:11 as **
  • An annotated bibliography on guaranteed graph searching
    Theoretical Computer Science, Vol. 399, No. 3. (6 June 2008), pp. 236-245.
    by Fedor V Fomin, Dimitrios M Thilikos
    posted to graph game algorithms by AbnerCYH on 2008-05-20 04:03:18 as **
  • Digraph measures: Kelly decompositions, games, and orderings
    Theoretical Computer Science, Vol. 399, No. 3. (6 June 2008), pp. 206-219.
    by Paul Hunter, Stephan Kreutzer
    posted to graph algorithms by AbnerCYH on 2008-05-20 04:03:10 as **
  • Davenport-Schinzel sequences and their geometric applications
    (1996)
    by Micha Sharir, Pankaj K Agarwal
    posted to math geometries algorithms by AbnerCYH on 2008-05-20 03:05:57 as **
  • Davenport--Schinzel Sequences and Their Geometric Applications
    No. Technical report DUKE--TR--1995--21. (1995)
    by Pankaj K Agarwal, Micha
    posted to math geometries algorithms by AbnerCYH on 2008-05-20 03:05:46 as **
  • On finding lowest common ancestors in trees
    (1973), pp. 253-265.
    by AV Aho, JE Hopcroft, JD Ullman
    posted to graph algorithms by AbnerCYH on 2008-05-19 16:19:34 as **
    • ◇温馨提示◇本页的引用地址为： http://www.citeulike.org/user/AbnerCYH/tag/algorithms

    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.