Search results

  1. 1.
    0370314 - MÚ 2012 RIV DE eng C - Conference Paper (international conference)
    Chrobak, M. - Sgall, Jiří - Jeż, Łukasz
    Better bounds for incremental frequency allocation in bipartite graphs.
    Algorithms - ESA 2011. Berlin: Springer, 2011 - (Demetrescu, C.; Halldórsson, M.), s. 251-262. Lecture Notes in Computer Science, 6942. ISBN 978-3-642-23718-8.
    [19th Annual European Symposium. Saarbrücken (DE), 05.09.2011-09.09.2011]
    R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : asymptotic competitive ratio * bipartite graphs * different frequency
    Subject RIV: BA - General Mathematics
    http://www.springerlink.com/content/h25t5313l2u32n62/
    Permanent Link: http://hdl.handle.net/11104/0204153
    FileDownloadSizeCommentaryVersionAccess
    Sgall.pdf1277.2 KBPublisher’s postprintrequire
     
     
  2. 2.
    0330016 - ÚTIA 2010 RIV CZ eng C - Conference Paper (international conference)
    Vomlel, Jiří - Savický, Petr
    An experimental comparison of triangulation heuristics on transformed BN2O networks.
    [Experimentální srovnání triangulačních heuristik na transformovaných sítích BN2O.]
    Proceedings of the 8th Workshop on Uncertainty Processing. Praha: University of Economics, 2009 - (Kroupa, T.; Vejnarová, J.), s. 251-260. ISBN 978-80-245-1543-4.
    [WUPES 2009. Liblice (CZ), 19.09.2009-23.09.2009]
    R&D Projects: GA MŠMT 1M0572; GA MŠMT(CZ) 1M0545; GA AV ČR 1ET100300517; GA ČR GA201/09/1891; GA ČR GEICC/08/E010
    Grant - others:GA MŠk(CZ) 2C06019
    Institutional research plan: CEZ:AV0Z10750506; CEZ:AV0Z10300504
    Keywords : Bayesian networks * bipartite graphs * graph triangulation
    Subject RIV: IN - Informatics, Computer Science
    http://library.utia.cas.cz/separaty/2009/MTR/vomlel-an experimental comparison of triangulation heuristics on transformed bn2o networks.pdf
    Permanent Link: http://hdl.handle.net/11104/0175891
     
     


  This site uses cookies to make them easier to browse. Learn more about how we use cookies.