default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroshi Mabuchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j9]Masafumi Matsuhara, Norifumi Watanabe, Goutam Chakraborty, Hiroshi Mabuchi:
Situation-based reply candidate presentation method for mobile phone. Int. J. Inf. Technol. Commun. Convergence 3(4): 319-336 (2020)
2010 – 2019
- 2019
- [c22]Yuki Okude, Masafumi Matsuhara, Goutam Chakraborty, Hiroshi Mabuchi:
Improving Awareness of Emotional Meaning of Emoticon by Representing as Numerical Vectors. iCAST 2019: 1-6 - [c21]Norifumi Watanabe, Masafumi Matsuhara, Goutam Chakraborty, Hiroshi Mabuchi:
Method to Present Situation Aware Suitable Reply Candidate on Mobile Terminal. iCAST 2019: 1-6 - 2018
- [c20]Hiroyuki Abe, Masafumi Matsuhara, Goutam Chakraborty, Hiroshi Mabuchi:
Topic-Aware Automatic Snippet Generation for Resolving Multiple Meaning on Web Search Result. iCAST 2018: 133-138 - 2015
- [c19]Masafumi Matsuhara, Taichi Sugawara, Goutam Chakraborty, Hiroshi Mabuchi:
An efficient image-aware Kana-Kanji conversion algorithm for Twitter on mobile phones. iCAST 2015: 49-54 - 2013
- [c18]Masafumi Matsuhara, Miki Itoh, Goutam Chakraborty, Hiroshi Mabuchi:
An efficient pressure-aware character input algorithm for mobile phones. iCAST/UMEDIA 2013: 191-197 - 2012
- [c17]Toshihiro Yoshida, Masafumi Matsuhara, Goutam Chakraborty, Hiroshi Mabuchi:
A novel ranking method of web search result using clustering and concordance count. IJCNN 2012: 1-6 - 2010
- [c16]Kazuhiko Yamashita, Goutam Chakraborty, Hiroshi Mabuchi, Masafumi Matsuhara:
An Efficient Method to Set RBF Network Paramters Based on SOM Training. CIT 2010: 426-431 - [c15]Goutam Chakraborty, Hideyuki Kurokawa, Basabi Chakraborty, Masafumi Matsuhara, Hiroshi Mabuchi, Yasuo Terayama:
How best to restore operations of a damaged ANN? IJCNN 2010: 1-7
2000 – 2009
- 2007
- [j8]Hiroshi Mabuchi, Kiyoshi Akama, Hidekatsu Koike, Katsunori Miura:
Infinite Computation in the Equivalent Transformation Model. J. Adv. Comput. Intell. Intell. Informatics 11(2): 176-186 (2007) - [j7]Hiroshi Mabuchi, Kiyoshi Akama, Katsunori Miura, Takahiko Ishikawa:
Constraint Solving Specializations for Equality on an Interval-Variable Domain. J. Adv. Comput. Intell. Intell. Informatics 11(2): 210-219 (2007) - [c14]Takuma Jumonji, Goutam Chakraborty, Hiroshi Mabuchi, Masafumi Matsuhara:
A novel distributed genetic algorithm implementation with variable number of islands. IEEE Congress on Evolutionary Computation 2007: 4698-4705 - 2006
- [j6]Hidekatsu Koike, Kiyoshi Akama, Hiroshi Mabuchi:
Dynamic Interaction of Syntactic and Semantic Analyses Based on the Equivalent Transformation Computation Model. J. Adv. Comput. Intell. Intell. Informatics 10(3): 302-311 (2006) - [j5]Yoshinori Shigeta, Kiyoshi Akama, Hiroshi Mabuchi, Hidekatsu Koike:
Converting Constraint Handling Rules to Equivalent Transformation Rules. J. Adv. Comput. Intell. Intell. Informatics 10(3): 339-348 (2006) - [j4]Itaru Takarajima, Kiyoshi Akama, Ikumi Imani, Hiroshi Mabuchi:
Design of Nondeterministic Program Termination Based on the Equivalent Transformation Computation Model. J. Adv. Comput. Intell. Intell. Informatics 10(3): 349-361 (2006) - [c13]Daisuke Senzaki, Hiroshi Mabuchi, Goutam Chakraborty
, Masafumi Matsuhara:
Mobility Pattern Learning and Route Prediction Based Location Management in PCS Network. AINA (2) 2006: 351-360 - [c12]Hiroshi Mabuchi, Kiyoshi Akama, Toshihiro Wakatsuki:
Equivalent Transformation Rules as Components of Programs. ICICIC (2) 2006: 282-287 - 2005
- [c11]Hiroshi Mabuchi, Kiyoshi Akama, Hidekatsu Koike, Takahiko Ishikawa:
Correctness Proof for Equivalent Transformation of Equality Constraints on an Interval-Variable Domain. IC-AI 2005: 627-636 - [c10]Hiroshi Mabuchi, Kiyoshi Akama, Hidekatsu Koike, Takahiko Ishikawa:
Problem solving by equivalent transformation of negative constraints. SMC 2005: 357-363 - 2004
- [c9]Daisuke Senzaki, Hiroshi Mabuchi, Goutam Chakraborty, Masafumi Matsuhara:
Distance Based Location Management in Cellular PCS Network -a Critical Study. AINA (2) 2004: 95-98 - [c8]Daisuke Senzaki, Goutam Chakraborty, Masafumi Matsuhara, Hiroshi Mabuchi:
Improvement of Paging Cost by Updating Using Paging Delay Divergence. IWDC 2004: 502-507 - 2003
- [j3]Takahiko Ishikawa, Kiyoshi Akama, Hiroshi Mabuchi:
How to Make Programs from Problem Descriptions in the Equivalent Transformation Paradigm. J. Adv. Comput. Intell. Intell. Informatics 7(3): 260-267 (2003) - [j2]Hiroshi Mabuchi, Kiyoshi Akama, Takahiko Ishikawa, Hidekatsu Koike:
Integration of Syntactic Analysis and Semantic Interpretation Based on Equivalent Transformation. J. Adv. Comput. Intell. Intell. Informatics 7(3): 306-314 (2003) - 2002
- [c7]Hiroshi Mabuchi, Kiyoshi Akama, Takahiko Ishikawa, Y. Yamamoto:
Framework for Synthesis by Unfolding of Declarative Programs. IC-AI 2002: 1060-1066 - [c6]Kiyoshi Akama, Hiroshi Mabuchi, Takahiko Ishikawa, E. Boyd:
A Basic Framework for Infinite Computation. IC-AI 2002: 1080-1086 - 2001
- [c5]Kiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi:
A Theoretical Foundation of Program Synthesis by Equivalent Transformation. Ershov Memorial Conference 2001: 131-139 - [c4]Kiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi:
Equivalent Transformation by Safe Extension of Data Structures. Ershov Memorial Conference 2001: 140-148 - 2000
- [j1]Kiyoshi Akama, Hiroshi Mabuchi, Eiichi Miyamoto:
A theoretical foundation for solving "no-solution" problems by abstraction. Syst. Comput. Jpn. 31(1): 1-10 (2000) - [c3]Hiroshi Mabuchi, Kiyoshi Akama, Hidekatsu Koike, Yoshinori Shigeta:
Synthesis of Conversion Rules by Expanding Knowledge Representation. Artificial Intelligence and Soft Computing 2000: 434-440 - [c2]Hiroshi Mabuchi, Kiyoshi Akama, Yoshinori Shigeta, Hidekatsu Koike:
Semantic Interpretation by Rule-based Equivalent Transformation. Artificial Intelligence and Soft Computing 2000: 472-478 - [c1]Yoshinori Shigeta, Kiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi:
Unreachability for a Class of Rewriting Systems using Two Homomorphisms. Artificial Intelligence and Soft Computing 2000: 494-500
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-04-24 23:01 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:
