default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPonani S. Gopalakrishnan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j7]James Yeh, Ponani S. Gopalakrishnan, Kazushi Kuse:
Preface. IBM J. Res. Dev. 48(5-6): 597-600 (2004)- 2001
- [c29]Liam Comerford, David Frank, Ponani S. Gopalakrishnan, Ramesh Gopinath, Jan Sedivý:
The IBM Personal Speech Assistant. ICASSP 2001: 1-4
1990 – 1999
- 1999
- [c28]Ganesh N. Ramaswamy, Jan Kleindienst, Daniel M. Coffman, Ponani S. Gopalakrishnan, Chalapathy Neti:
A pervasive conversational interface for information interaction. EUROSPEECH 1999: 2663-2666 - 1998
- [c27]Scott Shaobing Chen, P. S. Gopalakrishnan:
Clustering via the Bayesian information criterion with applications in speech recognition. ICASSP 1998: 645-648 - [c26]Lazaros Polymenakos, Peder A. Olsen, D. Kanvesky, Ramesh A. Gopinath, Ponani S. Gopalakrishnan, Scott Saobing Chen:
Transcription of broadcast news-some recent improvements to IBM's LVCSR system. ICASSP 1998: 901-904 - [c25]Ganesh N. Ramaswamy, Ponani S. Gopalakrishnan:
Compression of acoustic features for speech recognition in network environments. ICASSP 1998: 977-980 - [c24]Ganesh N. Ramaswamy, Harry Printz, Ponani S. Gopalakrishnan:
A bootstrap technique for building domain-dependent language models. ICSLP 1998 - 1997
- [c23]Raimo Bakis, Scott Saobing Chen, Ponani S. Gopalakrishnan, Ramesh Gopinath, Stéphane H. Maes, Lazaros Polymenakos:
Transcription of broadcast news-system robustness issues and adaptation techniques. ICASSP 1997: 711-714 - 1996
- [c22]Lalit R. Bahl, Mukund Padmanabhan, David Nahamoo, P. S. Gopalakrishnan:
Discriminative training of Gaussian mixture models for large vocabulary speech recognition systems. ICASSP 1996: 613-616 - 1995
- [c21]Lalit R. Bahl, S. Balakrishnan-Aiyer, Jerome R. Bellegarda, Martin Franz, P. S. Gopalakrishnan, David Nahamoo, Miroslav Novak, Mukund Padmanabhan, Michael A. Picheny, Salim Roukos:
Performance of the IBM large vocabulary continuous speech recognition system on the ARPA Wall Street Journal task. ICASSP 1995: 41-44 - [c20]P. S. Gopalakrishnan, Lalit R. Bahl, Robert L. Mercer:
A tree search strategy for large-vocabulary continuous speech recognition. ICASSP 1995: 572-575 - 1994
- [c19]Ponani S. Gopalakrishnan, David Nahamoo, Mukund Padmanabhan, Michael A. Picheny:
A channel-bank-based phone detection strategy. ICASSP (2) 1994: 161-164 - [c18]Lalit R. Bahl, Peter V. de Souza, Ponani S. Gopalakrishnan, David Nahamoo, Michael A. Picheny:
Robust methods for using context-dependent features and models in a continuous speech recognizer. ICASSP (1) 1994: 533-536 - 1993
- [j6]Lalit R. Bahl, Steven V. De Gennaro, P. S. Gopalakrishnan, Robert L. Mercer:
A fast approximate acoustic match for large vocabulary speech recognition. IEEE Trans. Speech Audio Process. 1(1): 59-67 (1993) - [j5]Lalit R. Bahl, Jerome R. Bellegarda, Peter V. de Souza, P. S. Gopalakrishnan, David Nahamoo, Michael A. Picheny:
Multonic Markov word models for large vocabulary continuous speech recognition. IEEE Trans. Speech Audio Process. 1(3): 334-344 (1993) - [c17]Lalit R. Bahl, Peter V. de Souza, P. S. Gopalakrishnan, Michael A. Picheny:
Context dependent vector quantization for continuous speech recognition. ICASSP (2) 1993: 632-635 - [c16]Lalit R. Bahl, Peter V. de Souza, P. S. Gopalakrishnan, David Nahamoo, Michael Picheny:
Word lookahead scheme for cross-word right context models in a stack decoder. EUROSPEECH 1993: 851-854 - 1992
- [j4]Lalit R. Bahl, Peter V. de Souza, P. S. Gopalakrishnan, Dimitri Kanevsky, David Nahamoo:
Constructing candidate word lists using acoustically similar word groups. IEEE Trans. Signal Process. 40(11): 2814-2816 (1992) - [c15]Lalit R. Bahl, Peter V. de Souza, P. S. Gopalakrishnan, David Nahamoo, Michael A. Picheny:
A fast match for continuous speech recognition using allophonic models. ICASSP 1992: 17-20 - 1991
- [j3]P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal:
Approximate Algorithms for the Knapsack Problem on Parallel Computers. Inf. Comput. 91(2): 155-171 (1991) - [j2]P. S. Gopalakrishnan, Dimitri Kanevsky, Arthur Nádas, David Nahamoo:
An inequality for rational functions with applications to some statistical estimation problems. IEEE Trans. Inf. Theory 37(1): 107-113 (1991) - [c14]Lalit R. Bahl, Jerome R. Bellegarda, Peter V. de Souza, P. S. Gopalakrishnan, David Nahamoo, Michael A. Picheny:
A new class of fenonic Markov word models for large vocabulary continuous speech recognition. ICASSP 1991: 177-180 - [c13]Lalit R. Bahl, Peter V. de Souza, P. S. Gopalakrishnan, David Nahamoo, Michael A. Picheny:
Decision trees for phonological rules in continuous speech. ICASSP 1991: 185-188 - [c12]P. S. Gopalakrishnan, David Nahamoo:
Immediate recognition of embedded command words. EUROSPEECH 1991: 21-24 - [c11]Lalit R. Bahl, Peter V. de Souza, P. S. Gopalakrishnan, David Nahamoo, Michael Picheny:
Context Dependent Modeling of Phones in Continuous Speech Using Decision Trees. HLT 1991 - 1990
- [c10]Lalit R. Bahl, Peter V. de Souza, P. S. Gopalakrishnan, Dimitri Kanevsky, David Nahamoo:
Constructing groups of acoustically confusable words. ICASSP 1990: 85-88
1980 – 1989
- 1989
- [c9]Lalit R. Bahl, P. S. Gopalakrishnan, Dimitri Kanevsky, David Nahamoo:
Matrix fast match: a fast method for identifying a short list of candidate words for decoding. ICASSP 1989: 345-348 - [c8]Lalit R. Bahl, Raimo Bakis, Jerome R. Bellegarda, Peter F. Brown, David Burshtein, Subrata K. Das, Peter V. de Souza, P. S. Gopalakrishnan, Frederick Jelinek, Dimitri Kanevsky, Robert L. Mercer, Arthur Nádas, David Nahamoo, Michael A. Picheny:
Large vocabulary natural language continuous speech recognition. ICASSP 1989: 465-467 - [c7]P. S. Gopalakrishnan, Dimitri Kanevsky, Arthur Nádas, David Nahamoo:
A generalization of the Baum algorithm to rational objective functions. ICASSP 1989: 631-634 - [c6]Lalit R. Bahl, Steven V. De Gennaro, P. S. Gopalakrishnan, Robert L. Mercer:
A fast approximate acoustic match for large vocabulary speech recognition. EUROSPEECH 1989: 1156-1158 - 1988
- [c5]P. S. Gopalakrishnan, Dimitri Kanevsky, Arthur Nádas, David Nahamoo, Michael A. Picheny:
Decoder selection based on cross-entropies. ICASSP 1988: 20-23 - 1987
- [j1]Shaunak Pawagi, P. S. Gopalakrishnan, I. V. Ramakrishnan:
Computing Dominators in Parallel. Inf. Process. Lett. 24(4): 217-221 (1987) - 1986
- [c4]P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal:
Parallel Approximate Algorithms for the 0-1 Knapsack Problem. ICPP 1986: 444-451 - [c3]Shaunak Pawagi, P. S. Gopalakrishnan, I. V. Ramakrishnan:
A Parallel Algorithm for Dominators. ICPP 1986: 877-879 - 1985
- [c2]P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal:
Computing Tree Functions on Mesh-Connected Computers. ICPP 1985: 703-710 - [c1]P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal:
An Efficient Connected Components Algorithm on a Mesh-Connected Computer. ICPP 1985: 711-714
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:
