Jenq-Foung JF Yao

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with coauthor community group 3

> Home > Persons > Jenq-Foung JF Yao

Publications

2010
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/jcscoll/YaoX10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcscoll/YaoX10
Jenq-Foung JF Yao, Yongqiao Xiao:
Data structures for the most frequently used algorithm. J. Comput. Sci. Coll. 26(2): 223-230 (2010)
2005
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/jdwm/XiaoYY05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jdwm/XiaoYY05
Yongqiao Xiao, Jenq-Foung JF Yao, G. Yang:
Discovering Frequent Embedded Subtree Patterns from Large Databases of Unordered Labeled Trees. Int. J. Data Warehous. Min. 1(2): 70-92 (2005)
2003
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/icdm/XiaoYLD03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdm/XiaoYLD03
Yongqiao Xiao, Jenq-Foung JF Yao, Zhigang Li, Margaret H. Dunham:
Efficient Data Mining for Maximal Frequent Subtrees. ICDM 2003: 379-386
2001
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/icae/YaoD01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/icae/YaoD01
Jenq-Foung JF Yao, Margaret H. Dunham:
Caching management of mobile DBMS. Integr. Comput. Aided Eng. 8(2): 151-169 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.