default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMamoru Hoshi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c24]Kingo Kobayashi, Hajime Sato, Mamoru Hoshi:
The number of paths in boundary restricted Pascal triangle. ITA 2016: 1-10- 2014
- [c23]Michihiro Kobayakawa, Mamoru Hoshi, Koichiro Yuzawa:
Music Genre Classification of MPEG AAC Audio Data. ISM 2014: 347-352 - [c22]Kingo Kobayashi, Hajime Sato, Mamoru Hoshi, Hiroyoshi Morita:
Eulerian numbers revisited: Slices of hypercube. ITA 2014: 1-10 - 2011
- [c21]Michihiro Kobayakawa, Mamoru Hoshi:
Musical genre classification of MPEG-4 TwinVQ audio data. ICME 2011: 1-6 - 2010
- [j9]Kensuke Onishi, Michihiro Kobayakawa, Mamoru Hoshi:
mm-GNAT: Index Structure for Arbitrary Lp Norm. Inf. Media Technol. 5(4): 1255-1265 (2010) - [c20]Liru Zhang, Tadashi Ohmori, Mamoru Hoshi:
Keyword Search on Hybrid XML-Relational Databases Using XRjoin. DASFAA (1) 2010: 292-298 - [c19]Liru Zhang, Tadashi Ohmori, Mamoru Hoshi:
A System for Keyword Search on Hybrid XML-Relational Databases Using XRjoin. DASFAA (2) 2010: 448-451 - [c18]Michihiro Kobayakawa, Mamoru Hoshi:
A Method for Music Structure Analysis Using MPEG-4 TwinVQ Audio Compression. PCM (1) 2010: 100-111
2000 – 2009
- 2009
- [c17]Michihiro Kobayakawa, Shigenao Kinjo, Mamoru Hoshi, Tadashi Ohmori, Atsushi Yamamoto:
Fast Computation of Similarity Based on Jaccard Coefficient for Composition-Based Image Retrieval. PCM 2009: 949-955 - 2008
- [j8]Michihiro Kobayakawa, Takaya Morita, Mamoru Hoshi, Tadashi Ohmori:
A New Feature for Musical Genre Classification of MPEG-4 TwinVQ Audio Data. Inf. Media Technol. 3(3): 558-563 (2008) - [c16]Kensuke Onishi
, Mamoru Hoshi:
Cover Ratio of Absolute Neighbor. WALCOM 2008: 70-80 - 2007
- [c15]Michihiro Kobayakawa, Mamoru Hoshi:
A Partial Retrieval of Music Data with Different Bit Rate using MPEG-4 TwinVQ Audio Compression. ICDE Workshops 2007: 103-112 - [c14]Kensuke Onishi, Michihiro Kobayakawa, Mamoru Hoshi:
mm-GNAT: index structure for arbitrary Lp norm. ICDE Workshops 2007: 117-126 - [c13]Tadashi Ohmori, Masahide Naruse, Mamoru Hoshi:
A New Data Cube for Integrating Data Mining and OLAP. ICDE Workshops 2007: 896-903 - 2006
- [c12]Kingo Kobayashi, Hiroyoshi Morita, Mamoru Hoshi:
Percolation on a k-Ary Tree. GTIT-C 2006: 633-638 - [c11]Yoshinobu Yamashita, Tadashi Ohmori, Mamoru Hoshi:
Mining Web Structures Using Multi-Dimensional Data Mining Model. ICDE Workshops 2006: 119 - 2005
- [j7]Kingo Kobayashi, Hiroyoshi Morita, Mamoru Hoshi:
Percolation on a k-ary Tree. Electron. Notes Discret. Math. 21: 327 (2005) - [c10]Guanghao Li, Tadashi Ohmori, Mamoru Hoshi, Yoshinobu Yamashita:
A New Sequence Pattern Search Algorithm N-OPS. ICDE Workshops 2005: 1241 - [c9]Motohiro Nakanishi, Michihiro Kobayakawa, Mamoru Hoshi, Tadashi Ohmori:
A method for extracting a musical unit to phrase music data in the compressed domain of TwinVQ audio compression. ICME 2005: 584-587 - [c8]Michihiro Kobayakawa, Mamoru Hoshi, Kensuke Onishi:
A method for retrieving music data with different bit rates using MPEG-4 TwinVQ audio compression. ACM Multimedia 2005: 459-462 - 2002
- [c7]Tadashi Ohmori, Y. Tsutatani, Mamoru Hoshi:
A Novel Datacube Model Supporting Interactive Web-Log Mining. CW 2002: 419-427 - [c6]Michihiro Kobayakawa, Mamoru Hoshi:
A Texture Segmentation Method Using Hierarchical Correlations of Wavelet Coefficients. IEEE Pacific Rim Conference on Multimedia 2002: 191-199 - 2001
- [j6]Mamoru Hoshi, Te Sun Han:
Interval algorithm for homophonic coding. IEEE Trans. Inf. Theory 47(3): 1021-1031 (2001) - [c5]Kensuke Onishi, Michihiro Kobayakawa, Mamoru Hoshi, Tadashi Ohmori:
A Feature Independent Of Bit Rate For Twinvq Audio Retrieval. ICME 2001 - 2000
- [c4]W. Sae-Tung, Tadashi Ohmori, Mamoru Hoshi:
Integration of Web Information Sources by Mobile Users: Navigational Style of Integration and System Architecture. ADBIS-DASFAA Symposium 2000: 150-160 - [c3]Michihiro Kobayakawa, Mamoru Hoshi, Tadashi Ohmori:
Robust Texture Image Retrieval Using Hierarchical Correlations of Wavelet Coefficients. ICPR 2000: 3395-3400 - [c2]W. Sae-Tung, Tadashi Ohmori, Mamoru Hoshi:
An Integration System of Web Information Sources for Mobile Users. IDEAS 2000: 250-256
1990 – 1999
- 1997
- [j5]Te Sun Han, Mamoru Hoshi:
Interval algorithm for random number generation. IEEE Trans. Inf. Theory 43(2): 599-611 (1997) - 1995
- [c1]Tadashi Ohmori, Mamoru Hoshi:
Gaming-Simulations of Multi-Agent Information Systems using Large Databases: The Concept and Database Algorithms. DASFAA 1995: 95-106 - 1992
- [j4]Mamoru Hoshi, Philippe Flajolet:
Page Usage in a Quadtree Index. BIT 32(3): 384-402 (1992)
1980 – 1989
- 1987
- [j3]Toshitsugu Yuba, Mamoru Hoshi:
Binary Search Networks: A New Method for Key Searching. Inf. Process. Lett. 24(1): 59-65 (1987) - 1982
- [j2]Mamoru Hoshi, Toshitsugu Yuba:
A Counter Example to a Monotonicity Property of k-d Trees. Inf. Process. Lett. 15(4): 169-173 (1982)
1970 – 1979
- 1977
- [j1]Masahiro Miyakawa, Toshitsugu Yuba, Yoshio Sugito, Mamoru Hoshi:
Optimum Sequence Trees. SIAM J. Comput. 6(2): 201-234 (1977)
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-09-06 00:39 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:
