default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaoru Katayama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Kaoru Katayama, Youta Yamaji, Shotaro Toyoizumi, Takashi Hirashima:
Content-based Retrieval of 3D CAD Subassemblies Using 3D Radon Transform. J. Inf. Process. 31: 734-742 (2023)- 2020
- [j12]Kaoru Katayama, Takashi Hirashima:
A Retrieval Method for 3D CAD Assembly Models Using 3D Radon Transform and Spherical Harmonic Transform. IEICE Trans. Inf. Syst. 103-D(5): 992-1001 (2020)
2010 – 2019
- 2019
- [j11]Kaoru Katayama, Wataru Sato:
Subassembly Retrieval of 3D CAD Assembly Models with Different Layout of Components Based on Sinogram. IEICE Trans. Inf. Syst. 102-D(4): 777-787 (2019) - 2017
- [j10]Kaoru Katayama, Takumi Sato:
A Matching Method for 3D CAD Models with Different Assembly Structures Using Projections of Weighted Components. J. Inf. Process. 25: 376-385 (2017) - 2015
- [j9]Kaoru Katayama, Takumi Sato:
Matching 3D CAD Assembly Models with Different Layouts of Components Using Projections. IEICE Trans. Inf. Syst. 98-D(6): 1247-1250 (2015) - [j8]Kaoru Katayama, Ernest Weke Maina:
Indexing Method for Hierarchical Graphs based on Relation among Interlacing Sequences of Eigenvalues. J. Inf. Process. 23(2): 210-220 (2015) - 2014
- [j7]Kaoru Katayama, Takumi Sato:
Matrix Representations of Graphs and Their Experimental Comparison for Detecting Non-subgraphs by Eigenvalues. J. Inf. Process. 22(4): 638-641 (2014) - 2012
- [j6]Kaoru Katayama, Yosuke Amagasa, Hideki Nagaya:
Detecting Non-subgraphs Efficiently by Comparing Eigenvalues of Decomposed Graphs. IEICE Trans. Inf. Syst. 95-D(11): 2724-2727 (2012) - 2010
- [c14]Kaoru Katayama, Tatsuro Okawara, Yuka Ito:
A greedy algorithm for constructing a low-width generalized hypertree decomposition. ICDT 2010: 174-182
2000 – 2009
- 2006
- [j5]Erwan Loisant, José Martinez, Hiroshi Ishikawa, Kaoru Katayama:
Galois' Lattices as a Classification Technique for Image Retrieval. Inf. Media Technol. 1(2): 994-1006 (2006) - [j4]Yasuo Yamane, Tadashi Hoshiai, Hiroshi Tsuda, Manabu Ohta, Kaoru Katayama, Hiroshi Ishikawa:
Multi-vector feature space based on pseudo-Euclidean space and oblique basis. Multim. Tools Appl. 31(3): 287-308 (2006) - 2005
- [j3]Ernest Weke Maina, Manabu Ohta, Kaoru Katayama, Hiroshi Ishikawa:
Semantic Image Retrieval based on Ontology and Relevance Model - A Preliminary Study. J. Digit. Inf. Manag. 3(4): 227-230 (2005) - [c13]Shohei Yokoyama, Manabu Ohta, Kaoru Katayama, Hiroshi Ishikawa:
An Access Control Method Based on the Prefix Labeling Scheme for XML Repositories. ADC 2005: 105-113 - [c12]Erwan Loisant, José Martinez, Hiroshi Ishikawa, Manabu Ohta, Kaoru Katayama:
Building a Navigation Structure from a Fuzzy Relationship for Image Retrieval. ICDE Workshops 2005: 1179 - [c11]Hiroshi Ishikawa, Shohei Yokoyama, Manabu Ohta, Kaoru Katayama:
On Mining XML Structures Based on Statistics. KES (1) 2005: 379-390 - 2004
- [c10]Yasuo Yamane, Tadashi Hoshiai, Hiroshi Tsuda, Kaoru Katayama, Manabu Ohta, Hiroshi Ishikawa:
Multi-Vector Feature Space Based on Pseudo-Euclidean Space and Oblique Basis for Similarity Searches of Images. CVDB 2004: 27-34 - [c9]Manabu Ohta, Hirokazu Narita, Kaoru Katayama, Hiroshi Ishikawa:
Overlapping Clustering Methods for a Japanese Meta Search Engine. Databases and Applications 2004: 100-106 - [c8]Hiroshi Ishikawa, Yasuo Shioya, Takeshi Omi, Manabu Ohta, Kaoru Katayama:
A Peer-to-Peer Approach to Parallel Association Rule Mining. KES 2004: 178-188 - 2003
- [c7]Hiroshi Ishikawa, Manabu Ohta, Shohei Yokoyama, Takuya Watanabe, Kaoru Katayama:
Active Knowledge Mining for Intelligent Web Page Management. KES 2003: 975-983 - 2002
- [j2]Hiroshi Ishikawa, Manabu Ohta, Shohei Yokoyama, Junya Nakayama, Kaoru Katayama:
Web usage mining approaches to page recommendation and restructuring. Intell. Syst. Account. Finance Manag. 11(3): 137-148 (2002) - [c6]Hiroshi Ishikawa, Toshiyuki Nakajima, Tokuyo Mizuhara, Shohei Yokoyama, Junya Nakayama, Manabu Ohta, Kaoru Katayama:
An Intelligent Web Recommendation System: A Web Usage Mining Approach. ISMIS 2002: 342-350 - [c5]Hiroshi Ishikawa, Manabu Ohta, Shohei Yokoyama, Junya Nakayama, Kaoru Katayama:
On the Effectiveness of Web Usage Mining for Page Recommendation and Restructuring. Web, Web-Services, and Database Systems 2002: 253-267
1990 – 1999
- 1999
- [c4]Yahiko Kambayashi, Kaoru Katayama, Mukesh K. Mohania:
Modifying CSCW Environments Dynamically for Supporting Virtual Enterprises. RIDE 1999: 80-87 - 1998
- [j1]Osami Kagawa, Kaoru Katayama, Yahiko Kambayashi:
Selecting essential questions using question support facilities in a distance education system. Syst. Comput. Jpn. 29(7): 65-74 (1998) - [c3]Kaoru Katayama, Osami Kagawa, Yasuhiro Kamiya, Hideki Tsushima, Takuya Yoshihiro, Yahiko Kambayashi:
Use of Action History Views for Indexing Continuous Media Objects. AMCP 1998: 344-355 - [c2]Yahiko Kambayashi, Kaoru Katayama, Toshihiro Kakimoto, Hajime Iwamoto:
Flexible search functions for multimedia data with text and other auxiliary data. SAC 1998: 498-504 - 1995
- [c1]Osami Kagawa, Kaoru Katayama, Shin'ichi Konomi
, Yahiko Kambayashi:
Capturing Essential Question Support Facilities in the VIEW Classroom. DEXA 1995: 114-123
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-28 23:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
