![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Terrence L. Fine
Person information
- affiliation: Cornell University, Ithaca, NY, USA
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [j18]Chin-Jen Ku, Terrence L. Fine:
A Bayesian Independence Test for Small Datasets. IEEE Trans. Signal Process. 54(10): 4026-4031 (2006) - 2005
- [j17]Guillermo del Angel, Terrence L. Fine:
Information capacity and power control for slotted Aloha random-access systems. IEEE Trans. Inf. Theory 51(12): 4074-4090 (2005) - [j16]Chin-Jen Ku, Terrence L. Fine:
Testing for stochastic independence: application to blind source separation. IEEE Trans. Signal Process. 53(5): 1815-1826 (2005) - [c11]Leandro Chaves Rêgo, Terrence L. Fine:
Estimation of Chaotic Probabilities. ISIPTA 2005: 297-305 - 2004
- [j15]Guillermo del Angel, Terrence L. Fine:
Optimal power and retransmission control policies for random access systems. IEEE/ACM Trans. Netw. 12(6): 1156-1166 (2004) - 2003
- [c10]Chin-Jen Ku, Terrence L. Fine:
A new ICA algorithm for blind source separation. ICASSP (5) 2003: 33-36 - [c9]Pablo Ignacio Fierens, Terrence L. Fine:
Towards a Chaotic Probability Model for Frequentist Probability: The Univariate Case. ISIPTA 2003: 245-259 - 2001
- [c8]Pablo Ignacio Fierens, Terrence Fine:
Towards a Frequentist Interpretation of Sets of Measures. ISIPTA 2001: 179-187 - [e1]Gert De Cooman, Terrence Fine, Teddy Seidenfeld:
ISIPTA '01, Proceedings of the Second International Symposium on Imprecise Probabilities and Their Applications, Ithaca, NY, USA. Shaker 2001, ISBN 90-423-0130-9 [contents]
1990 – 1999
- 1999
- [j14]Terrence Fine, Sayandev Mukherjee:
Parameter Convergence and Learning Curves for Neural Networks. Neural Comput. 11(3): 747-769 (1999) - 1998
- [j13]Jen-Lun Yuan, Terrence L. Fine:
Neural-network design for small training sets of high dimension. IEEE Trans. Neural Networks 9(2): 266-280 (1998) - 1996
- [j12]Sayandev Mukherjee, Terrence L. Fine:
Online Steepest Descent Yields Weights with Nonnormal Limiting Distribution. Neural Comput. 8(5): 1075-1084 (1996) - [j11]Terrence L. Fine:
Review of 'Fundamentals of Artificial Neural Networks' (Hassoun, M.H.; 1995). IEEE Trans. Inf. Theory 42(4): 1322 (1996) - [c7]Sayandev Mukherjee, Terrence L. Fine:
Ensemble pruning algorithms for accelerated training. ICNN 1996: 96-101 - [c6]Chiu Fai Wong, Terrence L. Fine:
Adaptive blind equalization using artificial neural networks. ICNN 1996: 1974-1979 - 1994
- [c5]Michael J. Turmon, Terrence Fine:
Sample Size Requirements for Feedforward Neural Networks. NIPS 1994: 327-334 - [c4]Sayandev Mukherjee, Terrence Fine:
Asymptotics of Gradient-based Neural Network Training Algorithms. NIPS 1994: 335-342 - 1992
- [c3]Jen-Lun Yuan, Terrence Fine:
Forecasting Demand for Electric Power. NIPS 1992: 739-746 - 1990
- [c2]Terrence Fine:
Designing Linear Threshold Based Neural Network Pattern Classifiers. NIPS 1990: 811-817
1980 – 1989
- 1980
- [j10]Terrence L. Fine:
Review of 'An Introduction to Statistical Signal Processing with Application' (Srinath, M.D., and Rajasekaran, P. K.; 1979). IEEE Trans. Inf. Theory 26(5): 629 (1980)
1970 – 1979
- 1975
- [j9]Terrence L. Fine:
Uniformly reasonable source encoding is often practically impossible. IEEE Trans. Inf. Theory 21(4): 368-373 (1975) - 1972
- [j8]Terrence L. Fine:
Review of 'Utility Theory for Decision Making' (Fishburn, P. C.; 1970). IEEE Trans. Inf. Theory 18(5): 696-697 (1972) - 1971
- [c1]Terrence Fine:
Stochastic Independence and Computational Complexity. IFIP Congress (1) 1971: 46-51 - 1970
- [j7]Terrence Fine:
Extrapolation When Very Little is Known about the Source. Inf. Control. 16(4): 331-359 (1970) - [j6]Terrence L. Fine:
On the apparent convergence of relative frequency and its implications. IEEE Trans. Inf. Theory 16(3): 251-257 (1970)
1960 – 1969
- 1968
- [j5]Terrence L. Fine:
The response of a particular nonlinear system with feedback to each of two random processes. IEEE Trans. Inf. Theory 14(2): 255-264 (1968) - 1966
- [j4]Terrence L. Fine:
Optimum search for the location of the maximum of a unimodal function. IEEE Trans. Inf. Theory 12(2): 103-111 (1966) - 1965
- [j3]Terrence L. Fine:
Optimum mean-square quantization of a noisy input (Corresp.). IEEE Trans. Inf. Theory 11(2): 293-294 (1965) - 1964
- [j2]Terrence L. Fine:
Properties of an optimum digital system and applications. IEEE Trans. Inf. Theory 10(4): 287-296 (1964) - 1962
- [j1]Terrence L. Fine, Morris J. Levin:
Extreme-value theory applied to false-alarm probabilities (Corresp.). IRE Trans. Inf. Theory 8(3): 259-260 (1962)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-05-02 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint