default search action
Hajime Kubota
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c16]Hajime Kubota, Yuichi Kobayashi:
Probabilistic state estimation using force sensor information in contact motion of arm robot. MFI 2017: 324-329 - 2014
- [c15]Tomoki Nakao, Toshihiro Furukawa, Takako Suematsu, Hiroaki Utsumi, Hajime Kubota:
Application of intensity estimation method of the FID signal based on the high-order Prony estimation Method and selective evaluation criterion to Purity Estimation in quantitative NMR, dependence of the 13C decoupling and the sample spinning. ISPACS 2014: 165-170 - [c14]Tomoki Nakao, Toshihiro Furukawa, Takako Suematsu, Hiroaki Utsumi, Hajime Kubota:
Intensity estimation method of the FID signal based on the high-order Prony Method including evaluation used to the priori information in quantitative NMR. ISSPIT 2014: 67-72 - 2013
- [c13]Yu Taya, Toshihiro Abe, Gota Kawai, Toshihiro Furukawa, Hajime Kubota:
A classification method for absorption spectrum of considering proximity peak in NMR. ISPACS 2013: 419-422 - 2010
- [c12]Hajime Kubota, Keiichi Iwamura:
A New Fragile Watermarking Scheme and Its Security Evaluation. CCNC 2010: 1-5
2000 – 2009
- 2003
- [c11]Keisuke Murat, Hajime Kubota:
A Proposal for the Multivalued Modulation System Based on the Projection to Subspace. ICMENS 2003: 383- - 2002
- [c10]Shin'ichi Wakabayashi, Nobuyuki Iwauchi, Hajime Kubota:
A hierarchical standard cell placement method based on a new cluster placement model. APCCAS (1) 2002: 273-278 - [c9]Kazuyuki Takagi, Hajime Kubota, Kazuhiko Ozeki:
Combination of pause and F0 information in dependency analysis of Japanese sentences. INTERSPEECH 2002: 1173-1176
1990 – 1999
- 1999
- [c8]Masahiro Fukumoto, Hajime Kubota, Shigeo Tsujii:
Simplification of stochastic fastest NLMS algorithm. ISCAS (3) 1999: 158-161 - 1995
- [c7]Masahiro Fukumoto, Hajime Kubota, Shigeo Tsujii:
Improvement in Stability and Convergence Speed on Normalized LMS Algorithm. ISCAS 1995: 1243-1246 - 1994
- [c6]Masahiro Fukumoto, Hajime Kubota, Shigeo Tsujii:
New Block Adaptive Algorithm using the Conjugate Gradient Method. Applied Informatics 1994: 231-234 - [c5]Toshihiro Furukawa, Sadanobu Yoshimoto, Hajime Kubota:
A New Block Adaptive Algorithm Using Order Recursive UD Factorization Method. ISCAS 1994: 369-372 - 1993
- [c4]Toshihiro Furukawa, Hajime Kubota:
A new solution method for linear equation using the gradient method. ISCAS 1993: 2244-2247 - 1990
- [c3]Hiroshi Tsubokawa, Hajime Kubota, Shigeo Tsujii:
Effect of floating-point error reduction with recursive least square for parallel architecture. ICASSP 1990: 1487-1490
1980 – 1989
- 1989
- [c2]Kunio Oh'ishi, Hajime Kubota, Mahoki Onoda:
A new block adaptation algorithm realizing rapid identification system. ICASSP 1989: 976-979 - [c1]Toshihiro Furukawa, Hajime Kubota, Shigeo Tsujii:
The orthogonal projection algorithm for block adaptive signal processing. ICASSP 1989: 1059-1062
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:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint