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

xiaoyan2006 graph-theory [19 articles]

Recent papers added to xiaoyan2006 library classified by the tag graph-theory. You can also see everyone's graph-theory.
  • Graph mining: Laws, generators, and algorithms
    ACM Comput. Surv., Vol. 38, No. 1. (2006)
    by Deepayan Chakrabarti, Christos Faloutsos
    posted to thesis graph-theory by xiaoyan2006 on 2008-04-23 19:32:45 as ** along with 2 people yori sugarexpletive
  • Computational experiments with a lazy version of a  K  quickest simple path ranking algorithm
    TOP, Vol. 15, No. 2. (11 December 2007), pp. 372-382.
    by M Pascoal, M Captivo, J Clímaco
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-25 20:09:45 as **
  • An algorithm for ranking quickest simple paths
    Comput. Oper. Res., Vol. 32, No. 3. (March 2005), pp. 509-520.
    by Marta MB Pascoal, Eugénia, Ao C Jo\
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-25 20:00:28 as **
  • On the difficulty of some shortest path problems
    ACM Trans. Algorithms, Vol. 3, No. 1. (February 2007)
    by John Hershberger, Subhash Suri, Amit Bhosle
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-15 21:21:34 as **
  • TUBE (Text-cUBE) for discovering documentary evidence of associations among entities
    (2007), pp. 824-828.
    by Hady W Lauw, Ee-Peng Lim, Hweehwa Pang
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-04 17:40:48 as ** along with 1 person AlisonBabeu
  • Fast discovery of connection subgraphs
    (2004), pp. 118-127.
    by Christos Faloutsos, Kevin S Mccurley, Andrew Tomkins
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-04 17:33:56 as ** along with 11 people and 4 groups mamader jrw mhay zqshen ldietz fsilvestri bigbossman Repton sakaradam nicolasj daniel51 kdl GraphVis UCD_SmallWorldGraphVis InformationRetrieval
  • Unapparent information revelation: a concept chain graph approach
    (2005), pp. 329-330.
    by Rohini K Srihari, Sudarshan Lamkhede, Anmol Bhasin
    posted to application graph-theory hmm thesis by xiaoyan2006 on 2008-02-04 17:18:27 as **
  • GMine: a system for scalable, interactive graph visualization and mining
    (2006), pp. 1195-1198.
    by Jos&\#233; F Rodrigues, Hanghang Tong, Agma JM Traina, Christos Faloutsos, Jure Leskovec
    posted to exploring graph-theory thesis by xiaoyan2006 on 2008-02-04 17:07:14 as ** along with 4 people and 1 group wnpx ianturton bigbossman markymaypo ARTFL
  • Center-piece subgraphs: problem definition and fast solutions
    (2006), pp. 404-413.
    by Hanghang Tong, Christos Faloutsos
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-04 16:41:08 as ** along with 3 people and 2 groups uwenagel azygmunt michaelmampaey AGH-IISG ADMiRes
  • The Most Reliable Subgraph Problem
    Knowledge Discovery in Databases: PKDD 2007 (2007), pp. 471-478.
    by Petteri Hintsanen
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-04 16:38:33 as **
  • Discovering informative connection subgraphs in multi-relational graphs
    SIGKDD Explor. Newsl., Vol. 7, No. 2. (December 2005), pp. 56-63.
    by Cartic Ramakrishnan, William H Milnor, Matthew Perry, Amit P Sheth
    posted to graph-theory thesis by xiaoyan2006 on 2008-01-29 20:59:47 as ** along with 5 people uwenagel pablomendes bigbossman graphminer fwkroon
  • Fast discovery of connection subgraphs
    (2004), pp. 118-127.
    by Christos Faloutsos, Kevin S Mccurley, Andrew Tomkins
    posted to graph-theory by xiaoyan2006 on 2008-01-29 20:52:57 as ** along with 1 person uwenagel
  • Fast best-effort pattern matching in large attributed graphs
    (2007), pp. 737-746.
    by Hanghang Tong, Christos Faloutsos, Brian Gallagher, Tina Eliassi-Rad
    posted to graph-theory thesis by xiaoyan2006 on 2008-01-29 16:53:10 as **
  • Measuring and extracting proximity in networks
    (2006), pp. 245-255.
    by Yehuda Koren, Stephen C North, Chris Volinsky
    posted to graph-theory thesis by xiaoyan2006 on 2008-01-29 15:25:05 as ** along with 2 people balicea RafG
  • Searching in the plane
    Inf. Comput., Vol. 106, No. 2. (October 1993), pp. 234-252.
    by Ricardo A Baeza-Yates, Joseph C Culberson, Gregory JE Rawlins
    posted to graph-theory by xiaoyan2006 on 2007-11-05 18:40:47 as **
  • Parallel searching in the plane
    Comput. Geom. Theory Appl., Vol. 5, No. 3. (October 1995), pp. 143-154.
    by Ricardo Baeza-Yates, René Schott
    posted to graph-theory by xiaoyan2006 on 2007-11-05 18:38:45 as **
  • Competitive Algorithms for Layered Graph Traversal
    SIAM J. Comput., Vol. 28, No. 2. (April 1999), pp. 447-462.
    by Amos Fiat, Dean P Foster, Howard Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan
    posted to graph-theory by xiaoyan2006 on 2007-11-05 17:33:54 as **
  • notes Search in power law networks
    Physical Review E, Vol. 64 (October 2001), pp. 46135-46143.
    by Lada A Adamic, Bernardo A Huberman, Rajan M Lukose, Amit R Puniyani
    posted to graph-theory by xiaoyan2006 on 2007-11-05 17:29:44 as **
  • Semantic analytics on social networks: experiences in addressing the problem of conflict of interest detection
    (2006), pp. 407-416.
    by Boanerges Aleman-Meza, Meenakshi Nagarajan, Cartic Ramakrishnan, Li Ding, Pranam Kolari, Amit P Sheth, Budak I Arpinar, Anupam Joshi, Tim Finin
    posted to graph-theory semrank sn thesis by xiaoyan2006 on 2006-08-14 22:54:40 as *** along with 4 people and 3 groups krisl azygmunt chaosPanda amirmz VT_DLRL AGH-IISG Social Web
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/user/xiaoyan2006/tag/graph-theory

    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.