default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Kedem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Xuze Zhang
, Saumyadipta Pyne, Benjamin Kedem:
Multivariate Tail Probabilities: Predicting Regional Pertussis Cases in Washington State. Entropy 23(6): 675 (2021)
2010 – 2019
- 2010
- [c3]Ritaja Sur, Lior Noy, Tamar Flash, Benjamin Kedem:
Modeling long memory eye gaze data. EUVIP 2010: 193-197
2000 – 2009
- 2004
- [j13]Benjamin Kedem, David B. Wolff, Konstantinos Fokianos:
Statistical comparison of algorithms. IEEE Trans. Instrum. Meas. 53(3): 770-776 (2004) - 2001
- [j12]Konstantinos Fokianos, Benjamin Kedem, Jing Qin, David A. Short:
A Semiparametric Approach to the One-Way Layout. Technometrics 43(1): 56-65 (2001)
1990 – 1999
- 1998
- [j11]John T. Barnett, Benjamin Kedem:
Zero-Crossing Rates of Mixtures and Products of Gaussian Processes. IEEE Trans. Inf. Theory 44(4): 1672-1677 (1998) - 1994
- [j10]Ta-Hsin Li, Benjamin Kedem:
Iterative filtering for multiple frequency estimation. IEEE Trans. Signal Process. 42(5): 1120-1132 (1994) - [c2]Christian Houdré, Benjamin Kedem:
Peak and power. ICPR (3) 1994: 11-14 - 1993
- [j9]Ta-Hsin Li, Benjamin Kedem:
Strong consistency of the contraction mapping method for frequency estimation. IEEE Trans. Inf. Theory 39(3): 989-998 (1993) - [c1]Ta-Hsin Li, Benjamin Kedem:
Improving Prony's estimator for multiple frequency estimation by a general method of parametric filtering. ICASSP (4) 1993: 256-259 - 1992
- [j8]John T. Barnett, Benjamin Kedem:
Authors' Reply to Comments on 'Zero-crossing rates of functions of Gaussian processes'. IEEE Trans. Inf. Theory 38(1): 213- (1992) - 1991
- [j7]John T. Barnett, Benjamin Kedem:
Zero-crossing rates of functions of Gaussian processes. IEEE Trans. Inf. Theory 37(4): 1188-1194 (1991)
1980 – 1989
- 1989
- [j6]Shuyuan He, Benjamin Kedem:
Higher order crossings spectral analysis of an almost periodic random sequence in noise. IEEE Trans. Inf. Theory 35(2): 360-370 (1989) - 1986
- [j5]Benjamin Kedem:
Spectral analysis and discrimination by zero-crossings. Proc. IEEE 74(11): 1477-1493 (1986) - 1983
- [j4]Benjamin Kedem:
A two-dimensional higher order crossings theorem. IEEE Trans. Inf. Theory 29(1): 159-161 (1983) - 1982
- [j3]Benjamin Kedem:
Some Graphical Considerations in Time Series Analysis. IEEE Trans. Pattern Anal. Mach. Intell. 4(5): 493-499 (1982)
1970 – 1979
- 1977
- [j2]Benjamin Kedem:
Counting the number of 0-1 stationary time series having the same likelihood. Discret. Math. 18(3): 285-289 (1977) - 1976
- [j1]Benjamin Kedem:
Exact maximum likelihood estimation of the parameter in the AR(1) process after hard limiting (Corresp.). IEEE Trans. Inf. Theory 22(4): 491-493 (1976)
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-25 05:42 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:
