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

whym's algorithm [17 articles]

当前文献位于 whym's 文献库 标签分类为 algorithm. You can also see everyone's algorithm.
  • notes Fast Algorithms for Weighted Bipartite Matching
    Experimental and Efficient Algorithms (2005), pp. 476-487.
    by Justus Schwartz, Angelika Steger, Andreas Weißl
    posted to optimization algorithm by whym on 2008-10-30 11:40:54 as **
  • notes Computing Minimum-Weight Perfect Matchings
    INFORMS J. on Computing, Vol. 11, No. 2. (1999), pp. 138-148.
    by William Cook, Andre Rohe
    posted to optimization algorithm by whym on 2008-10-30 11:11:07 as **
  • notes An efficient reduction of ranking to classification
    (7 Dec 2007)
    by Nir Ailon, Mehryar Mohri
    posted to algorithm information-retrieval proof by whym on 2008-07-22 02:08:48 as read
  • Accelerated training of conditional random fields with stochastic gradient methods
    (2006)
    by Nicol N Vishwanathan
    posted to algorithm machine-learning by whym on 2008-05-02 07:59:14 as ** along with 1 person markusd
  • notes Clustering for metric and non-metric distance measures
    (2008), pp. 799-808.
    by Marcel R Ackermann, Johannes Blömer, Christian Sohler
    posted to algorithm clustering by whym on 2008-05-02 07:48:57 as ** along with 1 person idlebrain
  • notes Fast pattern-matching on indeterminate strings
    J. of Discrete Algorithms, Vol. 6, No. 1. (March 2008), pp. 37-50.
    by Jan Holub, WF Smyth, Shu Wang
    posted to algorithm stringology by whym on 2008-03-26 00:33:56 as **
  • notes Pattern Matching for Permutations
    (1993), pp. 200-209.
    by Prosenjit Bose, Jonathan F Buss, Anna Lubiw
    posted to algorithm pattern-matching by whym on 2008-02-23 08:00:49 as **
  • The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data
    (19 Jul 2005)
    by David Eppstein, Michael T Goodrich, Jonathan Z Sun
  • notes Efficient training methods for maximum entropy language modelling
    (October 2000), pp. 114-117.
    by J Wu, S Khudanpur
    posted to algorithm language-modeling maximum-entropy by whym on 2008-02-13 13:23:22 as ****
  • notes Inducing Features of Random Fields
    IEEE Trans. Pattern Anal. Mach. Intell., Vol. 19, No. 4. (April 1997), pp. 380-393.
    by Stephen Della Pietra, Vincent Della Pietra, John Lafferty
  • notes Classes for fast maximum entropy training
    Vol. 1 (2001), pp. 561-564.
    by J Goodman
    posted to algorithm maximum-entropy by whym on 2008-02-11 07:01:16 as ** along with 1 person rayzhang
  • Updating Quasi-Newton Matrices with Limited Storage
    Mathematics of Computation, Vol. 35, No. 151. (1980), pp. 773-782.
    by Jorge Nocedal
  • Simple linear work suffix array construction
    (2003)
  • Compressed indexes for dynamic text collections
    ACM Trans. Algorithms, Vol. 3, No. 2. (May 2007)
    by Ho-Leung Chan, Wing-Kai Hon, Tak-Wah Lam, Kunihiko Sadakane
    posted to algorithm stringology by whym on 2007-09-04 00:52:17 as **
  • Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets
    Combinatorial Pattern Matching (2005), pp. 168-177.
    by Shiri Dori, Gad M Landau
    posted to algorithm pattern-matching stringology by whym on 2007-09-04 00:49:06 as ** along with 1 person ariels
  • From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction
    Algorithmica, Vol. 19, No. 3. (1997), pp. 331-353.
    by Robert Giegerich, Stefan Kurtz
  • Fast exact maximum likelihood estimation for mixture of language models
    (2007), pp. 865-866.
    by Yi Zhang, Wei Xu
    posted to algorithm information-retrieval language-modeling by whym on 2007-08-10 10:24:40 as **
  • ◇温馨提示◇本页的引用地址为: http://www.citeulike.org/user/whym/tag/algorithm

    RIS BibTeX
    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.