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

chechetka's library [22 articles]

Recent papers added to chechetka's library.
  • Near-optimal Nonmyopic Value of Information in Graphical Models
    (2005)
    by Andreas Krause, Carlos Guestrin
    posted to _cited-by-nips2007 bayes-networks graphical-models markov-networks submodularity by chechetka on 2007-06-08 17:35:06 as **
  • 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
  • The ALARM Monitoring System: A Case Study with Two Probablistic Inference Techniques for Belief Networks
    (1988)
    by Ingo Beinlich, Jaap Suermondt, Martin Chavez, Gregory Cooper
    posted to _cited-by-nips2007 bayes-networks graphical-models by chechetka on 2007-06-04 06:15:38 as **
  • 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 **
  • 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 11 people creswick greenw ima danielaugot lcigler fdr eporreca Fin payton345 djlin tkollar
  • 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 3 people frohike wnpx naegele
  • 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
  • Learning Bayesian Networks is NP-Complete
    (1996), pp. 121-130.
    by David M Chickering
    edited by D Fisher, HJ Lenz
    posted to _cited-by-nips2007 bayes-networks graphical-models hardness structure-learning by chechetka on 2007-04-29 20:28:17 as ***
  • Maximum Likelihood Bounded Tree-Width Markov Networks
    (2001), pp. 504-51.
    by Nathan Srebro
    posted to _cited-by-nips2007 graphical-models hardness structure-learning by chechetka on 2007-04-29 20:17:17 as ***
  • 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 4 people and 2 groups alterego bhaddow whym mmunson ReachGrasp ComputationalCognitiveNeuroscienceLab
  • Finding Optimal Bayesian Networks by Dynamic Programming
    No. CMU-CALD-05-106. (2005)
    by Ajit Singh, Andrew Moore
    posted to _cited-by-nips2007 bayes-networks graphical-models structure-learning by chechetka on 2007-04-29 20:10:43 as read
  • Learning Factor Graphs in Polynomial Time and Sample Complexity
    Journal of Machine Learning Research, Vol. 7 (August 2006), pp. 1743-1788.
    by Pieter Abbeel, Daphne Koller, Andrew Y Ng
    posted to _cited-by-nips2007 factor-graphs graphical-models structure-learning by chechetka on 2007-04-29 20:08:41 as read along with 3 people and 3 groups mhay feasel rsantana kdl unc_cs_eve UNC-FPM
  • Ordering-based Search: A Simple and Effective Algorithm for Learning Bayesian Networks
    (2005)
    by Marc Teyssier, Daphne Koller
    posted to _cited-by-nips2007 bayes-networks graphical-models structure-learning by chechetka on 2007-04-29 20:06:21 as read
  • 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 tkollar pcarbo bpacker pliz craigtalbert dwf roys vision-ng
  • 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
  • On Bayesian Network Approximation by Edge Deletion
    (2005)
    by Arthur Choi, Hei Chan, Adnan Darwiche
    posted to _cited-by-nips2007 graphical-models structure-learning by chechetka on 2007-04-29 19:55:55 as read along with 1 person pcarbo
  • Thin Junction Trees
    (2002)
    by Francis R Bach, Michael I Jordan
    posted to _cited-by-nips2007 graphical-models junction-trees markov-networks structure-learning by chechetka on 2007-04-29 19:51:11 as read
  • 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 4 people and 1 group quianominorleo garyfeng Borelli wnpx ReadingLab
  • 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 naegele wnpx
  • Learning Graphical Models Over Partial k-Trees
    No. UWEETR-2004-0009. (2004)
    by Mukund Narasimhan, Jeff Bilmes
    posted to _cited-by-nips2007 graphical-models junction-trees pac-learning structure-learning by chechetka on 2007-04-27 19:38:05 as read
  • Learning and Robust Learning of Product Distributions
    (1993)
    by Klaus U Höffgen
    posted to _cited-by-nips2007 entropy-estimation by chechetka on 2007-04-27 19:38:05 as read
  • 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
    • Note: You may cite this page as: http://www.citeulike.org/user/chechetka

    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.