|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 9 keywords
|
|
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee |
Submodular functions are noise stable.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee |
Submodular Functions Are Noise Stable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan |
Efficiently Testing Sparse GF(2) Polynomials. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly Feldman, Homin K. Lee, Rocco A. Servedio |
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas. |
Journal of Machine Learning Research - Proceedings Track |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee |
Submodular Functions Are Noise Stable |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan |
Learning random monotone DNF. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith |
What Can We Learn Privately? |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Homin K. Lee, Andrew Wan |
Mansour's Conjecture is True for Random DNF Formulas. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vitaly Feldman, Homin K. Lee, Rocco A. Servedio |
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Homin K. Lee |
Decision Trees and Influence: an Inductive Proof of the OSSS Inequality. |
Theory of Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Homin K. Lee, Andrew Wan |
Mansour's Conjecture is True for Random DNF Formulas. |
COLT |
2010 |
DBLP BibTeX RDF |
|
| 1 | Homin K. Lee |
Learning Talagrand DNF Formulas. |
COLT |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee |
Optimal Cryptographic Hardness of Learning Monotone Functions. |
Theory of Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith |
What Can We Learn Privately? |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan |
Efficiently Testing Sparse GF(2) Polynomials |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan |
Efficiently Testing Sparse GF(2) Polynomials. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee |
Optimal Cryptographic Hardness of Learning Monotone Functions. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan |
Learning Random Monotone DNF. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith |
What Can We Learn Privately? |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan |
Learning Random Monotone DNF. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan |
Testing for Concise Representations. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan |
Separating Models of Learning from Correlated and Uncorrelated Data. |
Journal of Machine Learning Research |
2007 |
DBLP BibTeX RDF |
|
| 1 | Homin K. Lee, Rocco A. Servedio, Andrew Wan |
DNF are teachable in the average case. |
Machine Learning |
2007 |
DBLP DOI BibTeX RDF |
DNF formulas, Teaching dimension |
| 1 | Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan |
Testing for Concise Representations. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Homin K. Lee, Tal Malkin, Erich M. Nahum |
Cryptographic strength of ssl/tls servers: current and recent practices. |
Internet Measurement Comference |
2007 |
DBLP DOI BibTeX RDF |
network security, servers, ssl |
| 1 | Homin K. Lee, Rocco A. Servedio, Andrew Wan |
DNF Are Teachable in the Average Case. |
COLT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Homin K. Lee, William Braynen, Kiran Keshav, Paul Pavlidis |
ErmineJ: Tool for functional analysis of gene expression data sets. |
BMC Bioinformatics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan |
Separating Models of Learning from Correlated and Uncorrelated Data. |
COLT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Theodore Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung |
The dual receiver cryptosystem and its applications. |
ACM Conference on Computer and Communications Security |
2004 |
DBLP DOI BibTeX RDF |
useful secure computation, digital signature, elliptic curves, public key, key escrow, puzzles, pairing-based cryptography |
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")