default search action
Scott E. Decatur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [p1]Scott E. Decatur, Oded Goldreich, Dana Ron:
A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy. Computational Complexity and Property Testing 2020: 1-8
1990 – 1999
- 1999
- [j5]Scott E. Decatur, Oded Goldreich, Dana Ron:
Computational Sample Complexity. SIAM J. Comput. 29(3): 854-879 (1999) - 1998
- [j4]Javed A. Aslam, Scott E. Decatur:
General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Boosting. Inf. Comput. 141(2): 85-118 (1998) - [j3]Javed A. Aslam, Scott E. Decatur:
Specification and Simulation of Statistical Query Algorithms for Efficiency and Noise Tolerance. J. Comput. Syst. Sci. 56(2): 191-208 (1998) - 1997
- [j2]Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Sridhar Hannenhalli, Martin Farach, S. Muthukrishnan, Steven Skiena:
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. J. Comput. Biol. 4(3): 275-296 (1997) - [c11]Scott E. Decatur:
PAC Learning with Constant-Partition Classification Noise and Applications to Decision Tree Induction. AISTATS 1997: 147-156 - [c10]Scott E. Decatur, Oded Goldreich, Dana Ron:
Computational Sample Complexity. COLT 1997: 130-142 - [c9]Scott E. Decatur:
PAC Learning with Constant-Partition Classification Noise and Applications to Decision Tree Induction. ICML 1997: 83-91 - [c8]Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, S. Muthukrishnan, Steven Skiena:
Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. RECOMB 1997: 1-2 - [c7]Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, Steven Skiena:
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. SODA 1997: 390-399 - [i2]Scott E. Decatur, Oded Goldreich, Dana Ron:
Computational Sample Complexity. Electron. Colloquium Comput. Complex. TR97 (1997) - [i1]Scott E. Decatur, Oded Goldreich, Dana Ron:
A Probabilistic Error-Correcting Scheme. IACR Cryptol. ePrint Arch. 1997: 5 (1997) - 1996
- [j1]Javed A. Aslam, Scott E. Decatur:
On the Sample Complexity of Noise-Tolerant Learning. Inf. Process. Lett. 57(4): 189-195 (1996) - 1995
- [c6]Scott E. Decatur:
Learning in Hybrid Noise Environments Using Statistical Queries. AISTATS 1995: 259-270 - [c5]Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur, Steven Homer:
On the Learnability of Zn-DNF Formulas (Extended Abstract). COLT 1995: 198-205 - [c4]Scott E. Decatur, Rosario Gennaro:
On Learning from Noisy and Incomplete Examples. COLT 1995: 353-360 - [c3]Javed A. Aslam, Scott E. Decatur:
Specification and Simulation of Statistical Query Algorithms for Efficiency and Noise Tolerance. COLT 1995: 437-446 - 1993
- [c2]Scott E. Decatur:
Statistical Queries and Faulty PAC Oracles. COLT 1993: 262-268 - [c1]Javed A. Aslam, Scott E. Decatur:
General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Bounding. FOCS 1993: 282-291
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-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint