Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKai Zhao 0003
Person information
- affiliation: Google Inc., New York, NY, USA
- affiliation (PhD 2017): Oregon State University, School of Electrical Engineering and Computer Science, Corvallis, OR, USA
- affiliation (2014): Microsoft Research, Redmond, WA, USA
- affiliation (2013): IBM T.J. Watson Research Center, Yorktown Heights, NY, USA
- affiliation (2010 - 2015): City University of New York, NY, USA
Other persons with the same name
- Kai Zhao — disambiguation page
- Kai Zhao 0001 — NEC Laboratories, Beijing, China
- Kai Zhao 0002 — Concordia University, Montreal, Canada
- Kai Zhao 0004
![[0000-0003-0656-1901]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-0656-1901")
— Chongqing University, School of Automation, China - Kai Zhao 0005 — SanDisk, MA, USA (and 1 more)
- Kai Zhao 0006 — Shanghai Jiao Tong University, City Key Laboratory of Automobile Engineering of Shanghai, China
- Kai Zhao 0007 — Beijing Normal University, Beijing, China (and 1 more)
- Kai Zhao 0008 — Florida State University, FL, USA (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i7]Liang Huang, He Zhang, Dezhong Deng, Kai Zhao, Kaibo Liu, David A. Hendrix, David H. Mathews:
LinearFold: linear-time approximate RNA folding by 5'-to-3' dynamic programming and beam search. CoRR abs/2001.04020 (2020)
2010 – 2019
- 2019
- [j1]Liang Huang, He Zhang, Dezhong Deng, Kai Zhao, Kaibo Liu, David A. Hendrix, David H. Mathews:
LinearFold: linear-time approximate RNA folding by 5'-to-3' dynamic programming and beam search. Bioinform. 35(14): i295-i304 (2019) - 2018
- [i6]Liang Huang, Kai Zhao, Mingbo Ma:
When to Finish? Optimal Beam Search for Neural Text Generation (modulo beam size). CoRR abs/1809.00069 (2018) - 2017
- [c15]Kai Zhao, Liang Huang:
Joint Syntacto-Discourse Parsing and the Syntacto-Discourse Treebank. EMNLP 2017: 2117-2123 - [c14]Liang Huang, Kai Zhao, Mingbo Ma:
When to Finish? Optimal Beam Search for Neural Text Generation (modulo beam size). EMNLP 2017: 2134-2139 - [c13]Mingbo Ma, Kai Zhao, Liang Huang, Bing Xiang, Bowen Zhou:
Jointly Trained Sequential Labeling and Classification by Sparse Attention Neural Networks. INTERSPEECH 2017: 3334-3338 - [c12]Mingbo Ma, Dapeng Li, Kai Zhao, Liang Huang:
OSU Multimodal Machine Translation System Report. WMT 2017: 465-469 - [i5]Kai Zhao, Liang Huang, Mingbo Ma:
Textual Entailment with Structured Attentions and Composition. CoRR abs/1701.01126 (2017) - [i4]Kai Zhao, Liang Huang:
Joint Syntacto-Discourse Parsing and the Syntacto-Discourse Treebank. CoRR abs/1708.08484 (2017) - [i3]Mingbo Ma, Kai Zhao, Liang Huang, Bing Xiang, Bowen Zhou:
Jointly Trained Sequential Labeling and Classification by Sparse Attention Neural Networks. CoRR abs/1709.10191 (2017) - [i2]Mingbo Ma, Dapeng Li, Kai Zhao, Liang Huang:
OSU Multimodal Machine Translation System Report. CoRR abs/1710.02718 (2017) - 2016
- [c11]Kai Zhao, Liang Huang, Mingbo Ma:
Textual Entailment with Structured Attentions and Composition. COLING 2016: 2248-2258 - 2015
- [c10]Liang Huang, Kai Zhao:
Scalable Large-Margin Structured Learning: Theory and Algorithms. ACL (Tutorial Abstracts) 2015: 19-20 - [c9]Feifei Zhai, Liang Huang, Kai Zhao:
Search-Aware Tuning for Hierarchical Phrase-based Decoding. EMNLP 2015: 1282-1291 - [c8]Kai Zhao, Liang Huang:
Type-Driven Incremental Semantic Parsing with Polymorphism. HLT-NAACL 2015: 1416-1421 - 2014
- [c7]Liang Huang, Kai Zhao, Lemao Liu:
Scalable Large-Margin Structured Learning: Theory and Algorithms. ACL (Tutorial Abstracts) 2014: 4-5 - [c6]Kai Zhao, Liang Huang, Haitao Mi, Abraham Ittycheriah:
Hierarchical MT Training using Max-Violation Perceptron. ACL (2) 2014: 785-790 - [i1]Kai Zhao, Liang Huang:
Type-Driven Incremental Semantic Parsing with Polymorphism. CoRR abs/1411.5379 (2014) - 2013
- [c5]Yoav Goldberg, Kai Zhao, Liang Huang:
Efficient Implementation of Beam-Search Incremental Parsers. ACL (2) 2013: 628-633 - [c4]Kai Zhao, James Cross, Liang Huang:
Optimal Incremental Parsing via Best-First Dynamic Programming. EMNLP 2013: 758-768 - [c3]Hao Zhang, Liang Huang, Kai Zhao, Ryan T. McDonald:
Online Learning for Inexact Hypergraph Search. EMNLP 2013: 908-913 - [c2]Heng Yu, Liang Huang, Haitao Mi, Kai Zhao:
Max-Violation Perceptron and Forced Decoding for Scalable MT Training. EMNLP 2013: 1112-1123 - [c1]Kai Zhao, Liang Huang:
Minibatch and Parallelization for Online Large Margin Structured Learning. HLT-NAACL 2013: 370-379
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-06-18 23:05 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:
