The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew Wan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan
    Separating Models of Learning from Correlated and Uncorrelated Data. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:637-651 [Conf]
  2. Homin K. Lee, Rocco A. Servedio, Andrew Wan
    DNF Are Teachable in the Average Case. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:214-228 [Conf]
  3. Andrew Wan, Abdel Rigumye, Phillip Jones
    Profile Based Routing and Billing Multimedia Content Delivery Network. [Citation Graph (0, 0)][DBLP]
    ICN/ICONS/MCL, 2006, pp:172- [Conf]
  4. Benjamin W. Wah, Yixin Chen, Andrew Wan
    Constrained Global Optimization by Constraint Partitioning and Simulated Annealing. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2006, pp:265-274 [Conf]
  5. Rocco A. Servedio, Andrew Wan
    Computing sparse permanents faster. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:3, pp:89-92 [Journal]
  6. Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan
    Separating Models of Learning from Correlated and Uncorrelated Data. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2007, v:8, n:, pp:277-290 [Journal]

  7. Learning Random Monotone DNF. [Citation Graph (, )][DBLP]


  8. A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions. [Citation Graph (, )][DBLP]


  9. Testing for Concise Representations. [Citation Graph (, )][DBLP]


  10. Efficiently Testing Sparse GF(2) Polynomials. [Citation Graph (, )][DBLP]


  11. Optimal Cryptographic Hardness of Learning Monotone Functions. [Citation Graph (, )][DBLP]


  12. Superhuman performance of surgical tasks by robots using iterative learning from human-guided demonstrations. [Citation Graph (, )][DBLP]


  13. Hard Instances for Satisfiability and Quasi-one-way Functions. [Citation Graph (, )][DBLP]


  14. A fast parallel algorithm for finding the longest common sequence of multiple biosequences. [Citation Graph (, )][DBLP]


  15. Efficiently Testing Sparse GF(2) Polynomials [Citation Graph (, )][DBLP]


  16. A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions [Citation Graph (, )][DBLP]


  17. Testing for Concise Representations. [Citation Graph (, )][DBLP]


  18. Learning Random Monotone DNF. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002