dblp: K. Takahashi (disambiguation) (original) (raw)
default search action
- combined dblp search
- author search
- venue search
- publication search
Authors:
- no matches
Venues:
- no matches
Publications:
- no matches
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]
-
T. Fukushima, T. Kashima, S. Seto, H. Ohtori, M. Kato, K. Katou, H. Takehira, Y. Sugawara, Z. Zhu, K. Hara, R. Osanai, T. Beppu, H. Tahara, T. Ishiku, K. Takahashi, T. Ariga, Y. Ueda, Y. Matamura, Y. Mukae, N. Takeguchi, Y. Maruyama, R. Nishikawa, H. Kitagawa, J. Asakawa, Y. Uchiyama, K. Ohuchi, K. Sekine:
Fluorine-free Word Line Molybdenum Process for Enhancing Scalability and Reliability in 3D Flash Memory. VLSI Technology and Circuits 2024: 1-2
- 2021
[c5]-
-
-
Ken Namura, Johannes Maximilian Kühn, Tohru Adachi, H. Imachi, H. Kaneko, T. Kato, Go Watanabe, Naoto Tanaka, S. Kashihara, Hiroshi Miyashita, Y. Tomonaga, Ryosuke Okuta, Takuya Akiba, Brian Vogel, S. Kitajo, F. Osawa, K. Takahashi, Y. Takatsukasa, K. Mizumaru, Takuya Yamauchi, J. Ono, A. Takahashi, Tanvir Ahmed, Y. Doi, K. Hiraki, Jun Makino:
MN-Core - A Highly Efficient and Scalable Approach to Deep Learning. VLSI Circuits 2021: 1-2
2010 – 2019
- 2015
[j5]-
-
-
T. Vichiensamuth, Monsak Pimsarn
, K. Takahashi, Tanakorn Tantanawat:
A simplified model of a reinforced square hollow section T-joint for stress evaluation in bus superstructures. Int. J. Comput. Appl. Technol. 52(4): 228-236 (2015)
- 2013
[j4]-
-
-
G. Papantonopoulos, K. Takahashi, Tassos Bountis, B. G. Loos:
Using Cellular Automata Experiments to Model Periodontitis: a First Step towards Understanding the nonlinear Dynamics of the disease. Int. J. Bifurc. Chaos 23(3) (2013)
2000 – 2009
- 2001
[j3]-
-
-
Hameida Sayoud, K. Takahashi, B. Vaillant:
Designing communication network topologies using steady-state genetic algorithms. IEEE Commun. Lett. 5(3): 113-115 (2001)
[c4]- 2000
[j2]-
-
-
H. Yasuda, K. Takahashi, Takashi Matsumoto:
A Discrete HMM for Online Handwriting Recognition. Int. J. Pattern Recognit. Artif. Intell. 14(5): 675-688 (2000)
[j1]-
-
-
Joy Nicholson, K. Takahashi, Ryohei Nakatsu:
Emotion Recognition in Speech Using Neural Networks. Neural Comput. Appl. 9(4): 290-296 (2000)
1990 – 1999
- 1997
[c3]
K. Takahashi, H. Yasuda, Takashi Matsumoto:
A Fast HMM Algorithm for On-line Handwritten Character Recognition. ICDAR 1997: 369-375
1980 – 1989
- 1986
[c2]-
-
-
K. Takahashi, H. Yamada, H. Nagai, K. Matsumi:
A New String Search Hardware Architecture for VLSI. ISCA 1986: 20-27
- 1982
[c1]
K. Takahashi, T. Aso, M. Kobayashi:
Visual Aid for FORTRAN Program Debugging. ICSE 1982: 414-415
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).
load links from unpaywall.org
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).
load content from archive.org
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 
.
load data from openalex.org
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.
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
