default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBaruch Mazor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1995
[j6]Baruch Mazor, B. L. Zeigler:
The design of speech-interactive dialogs for transaction-automation systems. Speech Commun. 17(3-4): 313-320 (1995)- [c14]B. L. Zeigler, Baruch Mazor:
Query-response relationships in the oasis speech-recognition system. EUROSPEECH 1995: 1955-1958 - 1994
- [c13]Baruch Mazor, Jerome Braun, Bonnie Zeigler, Solomon Lerner, Ming-Whei Feng, Han Zhou:
OASIS - a speech recognition system for telephone service orders. ICSLP 1994: 679-682 - 1993
- [c12]Jerome Braun, Baruch Mazor:
Language based approach to system control in speech recognition systems. EUROSPEECH 1993: 2085-2088 - [c11]Baruch Mazor, Ming-Whei Feng:
Improved a-posteriori processing for keyword spotting. EUROSPEECH 1993: 2231-2234 - 1992
- [c10]Solomon Lerner, Baruch Mazor:
Telephone channel normalization for automatic speech recognition. ICASSP 1992: 261-264 - [c9]Ming-Whei Feng, Baruch Mazor:
Continuous word spotting for applications in telecommunications. ICSLP 1992: 21-24 - [c8]Solomon Lerner, Baruch Mazor:
Compensating for additive-noise in automatic speech recognition. ICSLP 1992: 723-726 - [c7]Dale E. Veeneman, Baruch Mazor:
Stochastic tree coding: voice coding for wireless channels. PIMRC 1992: 675-679 - 1990
- [c6]Dale E. Veeneman, Baruch Mazor:
An efficient code structure and search strategy for stochastic coding at 8 kb/s. ICASSP 1990: 481-484 - [c5]Solomon Lerner, Baruch Mazor:
Issues related to the estimation of time variant hidden Markov models [speech recognition]. ICASSP 1990: 553-556
1980 – 1989
- 1989
- [j5]Dale E. Veeneman, Baruch Mazor:
A fully adaptive comb filter for enhancing block-coded speech. IEEE Trans. Acoust. Speech Signal Process. 37(6): 955-957 (1989) - [c4]Baruch Mazor, C. Hudson, D. Borkowski:
Transform subbands coding with channel error control. ICASSP 1989: 172-175 - 1987
- [c3]Dale E. Veeneman, Baruch Mazor:
Enhancement of block-coded speech. ICASSP 1987: 193-196 - 1986
- [j4]Baruch Mazor, William A. Pearlman
:
A tree coding theorem for stationary Gaussian sources and the squared-error distortion measure. IEEE Trans. Inf. Theory 32(2): 156-165 (1986) - [c2]N. Morgan, Baruch Mazor:
Development of a 16-kb/s speech codec for telephone applications. ICASSP 1986: 345-348 - [c1]Baruch Mazor, Dale E. Veeneman, E. Mintz:
Adaptive subbands excited transform (ASET) coding. ICASSP 1986: 3075-3078 - 1985
- [j3]Baruch Mazor, William A. Pearlman:
An Optimal Transform Trellis Code with Applications to Speech. IEEE Trans. Commun. 33(10): 1109-1116 (1985) - 1983
- [j2]Baruch Mazor, William A. Pearlman:
A trellis code construction and coding theorem for stationary Gaussian sources. IEEE Trans. Inf. Theory 29(6): 924-930 (1983) - [j1]Baruch Mazor:
Optimal tree and trellis codes for stationary Gaussian sources (Ph.D. Thesis abstr.). IEEE Trans. Inf. Theory 29(6): 944 (1983)
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 22:50 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:
