Регистрация | Вход в службу | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

AbnerCYH algorithms [415 articles]

Recent papers added to AbnerCYH library classified by the tag algorithms. You can also see everyone's algorithms.
  • 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 **
  • Singular Value Decomposition and Principal Component Analysis
    (3 Mar 2003)
    by Michael E Wall, Andreas Rechtsteiner, Luis M Rocha
    posted to kdd algorithms algebra by AbnerCYH on 2008-05-13 05:16:47 as ** along with 9 people pdlug elsantosneto stanley mystery sdvillal sugarexpletive kklo rspeer zambujo
  • Constructing boosting algorithms from SVMs: an application toone-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 **
  • The boosting approach to machine learning: An overview
    (2001)
    by R Schapire
    posted to stochastic kdd game algorithms by AbnerCYH on 2008-05-09 20:56:28 as ** along with 5 people and 2 groups egibaja mukundn bpacker zeppe bobstark Boosting vision-ng
  • Protein Structure from Contact Maps: A Case-Based Reasoning Approach
    Information Systems Frontiers, Vol. 8, No. 1. (February 2006), pp. 29-36.
    by Janice Glasgow, Tony Kuo, Jim Davies
    posted to kdd complex biology algorithms by AbnerCYH on 2008-05-09 13:15:47 as ** along with 1 person babakap
  • 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 **
  • Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology
    Research in Computational Molecular Biology (2007), pp. 16-31.
    by Rohit Singh, Jinbo Xu, Bonnie Berger
    posted to graph biology algorithms by AbnerCYH on 2008-05-08 19:53:01 as **
  • Separators for sphere-packings and nearest neighbor graphs
    J. ACM, Vol. 44, No. 1. (January 1997), pp. 1-29.
    by Gary L Miller, Shang-Hua Teng, William Thurston, Stephen A Vavasis
    posted to graph geometries combinatorics algorithms by AbnerCYH on 2008-05-08 19:24:16 as **
  • Protein side-chain packing problem: a maximum edge-weight clique algorithmic approach
    (2004), pp. 191-200.
    by Dukka KC Bahadur, Tatsuya Akutsu, Etsuji Tomita, Tomokazu Seki
    posted to graph biology algorithms by AbnerCYH on 2008-05-08 18:56:43 as **
  • Fast and accurate algorithms for protein side-chain packing
    J. ACM, Vol. 53, No. 4. (July 2006), pp. 533-557.
    by Jinbo Xu, Bonnie Berger
    posted to graph biology algorithms by AbnerCYH on 2008-05-08 18:56:38 as **
  • Recognizing the fold of a protein structure
    Bioinformatics, Vol. 19, No. 14. (22 September 2003), pp. 1748-1759.
    by Andrew Harrison, Frances Pearl, Ian Sillitoe, Tim Slidel, Richard Mott, Janet Thornton, Christine Orengo
    posted to graph complex biology algorithms by AbnerCYH on 2008-05-08 07:55:35 as **
  • Partitioned probe comparability graphs
    Theoretical Computer Science, Vol. 396, No. 1-3. (10 May 2008), pp. 212-222.
    by David B Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
    posted to graph algorithms by AbnerCYH on 2008-05-03 04:28:23 as **
  • Survey of graph database models
    ACM Comput. Surv., Vol. 40, No. 1. (February 2008), pp. 1-39.
    by Renzo Angles, Claudio Gutierrez
    posted to graph algorithms by AbnerCYH on 2008-05-02 16:51:52 as ** along with 2 people pdlug bigbossman
  • Width Parameters Beyond Tree-width and their Applications
    The Computer Journal, Vol. 51, No. 3. (1 May 2008), pp. 326-362.
    by Petr Hlineny, Sang-Il Oum, Detlef Seese, Georg Gottlob
    posted to parameterized graph algorithms by AbnerCYH on 2008-05-02 15:58:05 as **
  • Parameterized Complexity of Geometric Problems
    The Computer Journal, Vol. 51, No. 3. (1 May 2008), pp. 372-384.
    by Panos Giannopoulos, Christian Knauer, Sue Whitesides
    posted to parameterized geometries algorithms by AbnerCYH on 2008-05-02 15:57:51 as **
  • Combinatorial Optimization on Graphs of Bounded Treewidth
    The Computer Journal, Vol. 51, No. 3. (1 May 2008), pp. 255-269.
    by Hans L Bodlaender, Arie M Koster
    posted to parameterized graph algorithms by AbnerCYH on 2008-05-02 15:42:48 as *
  • Hierarchical structure and the prediction of missing links in networks
    Nature, Vol. 453, No. 7191., pp. 98-101.
    by Aaron Clauset, Cristopher Moore, MEJ Newman
    posted to graph complexity algorithms by AbnerCYH on 2008-05-02 08:41:08 as ** along with 24 people pbull jago Ema gtgt15 hryk nedwards i-stevenson pinney elsantosneto markusd eyliu craigwilson06 jyuh margaritis gagliol bryanhughes akshat tmmurali cactus tny briordan deanmalmgren soramame_0518 jjray
  • Sorting Jordan sequences in linear time
    (1985), pp. 196-203.
    by Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, Robert E Tarjan
    posted to geometries data_structure combinatorics algorithms by AbnerCYH on 2008-04-28 17:27:15 as **
  • Sorting Jordan sequences in linear time using level-linked search trees
    Inf. Control, Vol. 68, No. 1-3. (1986), pp. 170-184.
    by Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, Robert E Tarjan
    posted to data_structure combinatorics algorithms by AbnerCYH on 2008-04-28 17:23:00 as **
  • Understanding and Using Linear Programming (Universitext)
    (14 November 2006)
    by Jirí Matousek, Bernd Gärtner
    posted to optimization algorithms by AbnerCYH on 2008-04-23 02:25:56 as **
  • Finding frequent patterns in a large sparse graph
    (2004)
    by M Kuramochi, G Karypis
    posted to kdd graph algorithms by AbnerCYH on 2008-04-23 01:57:03 as ** along with 3 people and 1 group josedavid azygmunt Repton AGH-IISG
  • Mining the Web: Analysis of Hypertext and Semi Structured Data
    (15 August 2002)
    by Soumen Chakrabarti
    posted to algorithms complex kdd by AbnerCYH on 2008-04-22 10:39:36 as ** along with 21 people and 6 groups quianominorleo korakot jomeyertons pdlug meryn arthit ChaTo fsilvestri wcrosbie ergodique Jaykul mthomure ak flb86 KathrinJanke BastianSpanneberg amarois diogomartins votis brightbyte hehrig Philosophy_of_Information Blog_and_Wiki_Research automatic_summarization InformationRetrieval Wikipedia CoP_CMS
  • Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
    (14 March 2006)
    by H Ehrig, K Ehrig, U Prange, G Taentzer
    posted to algebra algorithms automata graph by AbnerCYH on 2008-04-22 10:08:40 as ** along with 1 person leonardo
  • Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
    Vol. 4947 (2008)
    by Lei Zou, Lei Chen, Huaming Zhang, Yansheng Lu, Qiang Lou
    posted to algorithms data_structure graph by AbnerCYH on 2008-04-21 15:41:28 as **
  • 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 **
  • Algorithm 513: Analysis of In-Situ Transposition [F1]
    ACM Trans. Math. Softw., Vol. 3, No. 1. (March 1977), pp. 104-110.
    by Esko G Cate, David W Twigg
    posted to algorithms data_structure by AbnerCYH on 2008-04-03 20:58:36 as **
  • Efficient parallel out-of-core matrix transposition
    Cluster Computing, 2003. Proceedings. 2003 IEEE International Conference on (2003), pp. 300-307.
    by S Krisnamoorthy, G Baumgartner, D Cociorva, Chi-Chung Lam, P Sadyappan
    posted to algorithms data_structure parallel by AbnerCYH on 2008-04-03 20:36:08 as **
  • An efficient algorithm for out-of-core matrix transposition
    Computers, IEEE Transactions on, Vol. 51, No. 4. (2002), pp. 420-438.
    by Jinwoo Suh, VK Prasanna
    posted to algorithms data_structure by AbnerCYH on 2008-04-03 20:36:01 as **
  • A general transposition method for a matrix on auxiliary store
    BIT Numerical Mathematics, Vol. 30, No. 1. (1 March 1990), pp. 2-16.
    by Nils Andersen
    posted to algorithms data_structure by AbnerCYH on 2008-04-03 18:49:43 as **
  • Efficient transposition algorithms for large matrices
    (1993), pp. 656-665.
    by SD Kaushik, CH Huang, RW Johnson, P Sadayappan, JR Johnson
    posted to algorithms by AbnerCYH on 2008-04-03 18:49:38 as **
  • PRIM: A Fast Matrix Transpose Method
    Software Engineering, IEEE Transactions on, Vol. SE-7, No. 2. (1981), pp. 255-257.
    by GC Goldbogen
    posted to algorithms data_structure by AbnerCYH on 2008-04-03 18:46:41 as **
  • An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification
    Combinatorica, Vol. 26, No. 2. (April 2006), pp. 207-230.
    by Seth Pettie
    posted to algorithms graph by AbnerCYH on 2008-04-03 12:05:53 as **
  • Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
    (2002), pp. 713-722.
    by Seth Pettie, Vijaya Ramachandran
    posted to algorithms graph parallel by AbnerCYH on 2008-04-03 12:02:12 as **
  • 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 **
  • A Faster Deterministic Algorithm for Minimum Spanning Trees
    (1997)
    by Bernard Chazelle
    posted to algorithms graph by AbnerCYH on 2008-04-03 11:54:01 as **
  • Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
    SIAM Journal on Computing, Vol. 28, No. 1. (1998), pp. 105-136.
    by Thomas H Cormen, Thomas Sundquist, Leonard F Wisniewski
    posted to algorithms complexity data_structure parallel by AbnerCYH on 2008-04-03 04:38:17 as **
  • Structured permuting in place on parallel disk systems
    (1996), pp. 128-139.
    by Leonard F Wisniewski
    posted to algorithms parallel sys_performance by AbnerCYH on 2008-04-02 19:18:30 as **
  • Permuting in Place
    SIAM Journal on Computing, Vol. 24, No. 2. (1995), pp. 266-278.
    by Faith E Fich, Ian J Munro, Patricio V Poblete
    posted to algorithms combinatorics by AbnerCYH on 2008-04-02 19:18:13 as **
  • In situ, Stable Merging by Way of the Perfect Shuffle
    The Computer Journal, Vol. 43, No. 1. (1 January 2000), pp. 40-53.
    by John Ellis, Minko Markov
    posted to algorithms combinatorics by AbnerCYH on 2008-04-02 17:13:18 as **
  • Computing the cycles in the perfect shuffle permutation
    Information Processing Letters, Vol. 75, No. 5. (31 October 2000), pp. 217-224.
    by John Ellis, Tobias Krahn, Hongbing Fan
    posted to algorithms combinatorics by AbnerCYH on 2008-04-02 16:59:32 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 **
  • Representation of an order as union of interval orders
    Vol. 831 (1994)
    by Christian Capelle
    posted to algorithms data_structure order by AbnerCYH on 2008-04-01 02:36:45 as **
  • On the Interplay Between Interval Dimension and Dimension
    SIAM Journal on Discrete Mathematics, Vol. 7, No. 1. (1994), pp. 32-40.
    by S Felsner, M Habib, RH Möhring
    posted to algorithms combinatorics order by AbnerCYH on 2008-04-01 01:58:06 as **
  • Chordal probe graphs
    Discrete Applied Mathematics, Vol. 143, No. 1-3. (30 September 2004), pp. 221-237.
    by Martin C Golumbic, Marina Lipshteyn
    posted to algorithms graph by AbnerCYH on 2008-03-29 10:10:53 as **
  • 2-Tree probe interval graphs have a large obstruction set
    Discrete Applied Mathematics, Vol. 150, No. 1-3. (1 September 2005), pp. 216-231.
    by Natasa Przulj, Derek G Corneil
    posted to algorithms graph by AbnerCYH on 2008-03-29 10:10:49 as **
  • Construction of probe interval models
    (2002), pp. 866-875.
    by Ross M Mcconnell, Jeremy P Spinrad
    posted to algorithms graph by AbnerCYH on 2008-03-29 10:10:45 as **
  • A polynomial time recognition algorithm for probe interval graphs
    (2001), pp. 477-486.
    by Julie L Johnson, Jeremy P Spinrad
    posted to algorithms graph by AbnerCYH on 2008-03-29 10:10:41 as **
  • On probe interval graphs
    Discrete Applied Mathematics, Vol. 88, No. 1-3. (9 November 1998), pp. 315-324.
    by FR Mcmorris, Chi Wang, Peisen Zhang
    posted to algorithms graph by AbnerCYH on 2008-03-29 10:10:39 as **
  • A theory of the learnable
    Commun. ACM, Vol. 27, No. 11. (November 1984), pp. 1134-1142.
    by LG Valiant
    posted to algorithms complexity kdd stochastic by AbnerCYH on 2008-03-29 07:16:02 as ** along with 5 people mthomure sdvillal dwf mangesh bsilverthorn
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/user/AbnerCYH/tag/algorithms

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