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

Ключевое слово _cited-by-nips2007 [11 articles]

Recent papers classified by the tag _cited-by-nips2007.
  • Inducing Features of Random Fields
    IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 19, No. 4. (April 1997), pp. 380-393.
    by Stephen Della Pietra, Vincent Della Pietra, John Lafferty
    posted to _cited-by-nips2007 graphical-models markov-networks structure-learning by chechetka on 2007-04-29 20:13:29 as read along with 5 people and 2 groups lfriedl alterego bhaddow whym mmunson ReachGrasp Computational Cognitive Neuroscience Lab
  • Computers and Intractability : A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
    (15 January 1979)
    by Michael R Garey, David S Johnson
    posted to _cited-by-nips2007 hardness by chechetka on 2007-05-01 20:37:32 as ** along with 12 people gale82 creswick greenw ima danielaugot lcigler fdr eporreca Fin payton345 djlin tkollar
  • Learning with mixtures of trees
    Journal of Machine Learning Research, Vol. 1 (2001), pp. 1-48.
    by Marina Meil\ua, Michael I Jordan
    posted to _cited-by-nips2007 graphical-models structure-learning by chechetka on 2007-04-29 19:58:53 as read
  • Model-driven data acquisition in sensor networks
    (2004)
    by Amol Deshpande, Carlos Guestrin, Sam Madden, Joseph Hellerstein, Wei Hong
    posted to _cited-by-nips2007 by chechetka on 2007-06-05 06:38:06 as ** along with 2 people and 1 group mhay kashmira kdl
  • Being Bayesian About Network Structure. A Bayesian Approach to Structure Discovery in Bayesian Networks
    Machine Learning Journal, Vol. V50, No. 1. (1 January 2003), pp. 95-125.
    by Nir Friedman, Daphne Koller
    posted to _cited-by-nips2007 graphical-models structure-learning by chechetka on 2007-04-29 06:30:02 as read along with 5 people and 1 group garyfeng Borelli wnpx quianominorleo naegele ReadingLab
  • Minimizing symmetric submodular functions
    Mathematical Programming, Vol. 82, No. 1. (June 1998), pp. 3-12.
    by Maurice Queyranne
    posted to _cited-by-nips2007 optimization submodularity by chechetka on 2007-05-07 16:46:27 as **
  • Causation, Prediction, and Search, Second Edition (Adaptive Computation and Machine Learning)
    (08 January 2001)
    by Peter Spirtes, Clark Glymour, Richard Scheines
    posted to _cited-by-nips2007 graphical-models markov-networks structure-learning by chechetka on 2007-04-29 22:01:51 as ** along with 4 people wnpx naegele frohike rsantana
  • PAC-learning bounded tree-width graphical models
    (2004), pp. 410-417.
    by Mukund Narasimhan, Jeff Bilmes
    posted to _cited-by-nips2007 graphical-models junction-trees markov-networks structure-learning by chechetka on 2007-04-26 05:58:03 as read along with 1 person roys
  • Probabilistic Networks and Expert Systems (Information Science and Statistics)
    (20 May 2003)
    by Robert G Cowell, Philip A Dawid, Steffen L Lauritzen, David J Spiegelhalter
    posted to _cited-by-nips2007 by chechetka on 2007-04-27 20:04:56 as read along with 2 people wnpx naegele
  • Approximating discrete probability distributions with dependence trees
    IEEE Transactions on Information Theory, Vol. 14, No. 3. (1968), pp. 462-467.
    by C Chow, C Liu
    posted to _cited-by-nips2007 graphical-models structure-learning by chechetka on 2007-04-29 20:00:23 as *** along with 7 people and 1 group pcarbo bpacker pliz craigtalbert dwf roys tkollar vision-ng
  • Complexity of Finding Embeddings in a k-Tree
    SIAM Journal on Algebraic and Discrete Methods, Vol. 8, No. 2. (1987), pp. 277-284.
    by Stefan Arnborg, Derek G Corneil, Andrzej Proskurowski
    posted to _cited-by-nips2007 by chechetka on 2007-04-29 21:27:24 as ** along with 1 person AbnerCYH
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/tag/_cited-by-nips2007

    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.