The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew B. Nobel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrew B. Nobel
    Evaluating the Performance of a Simple Inductive Procedure in the Presence of Overfitting Error. [Citation Graph (0, 0)][DBLP]
    COLT, 1991, pp:267-274 [Conf]
  2. Xing Sun, Andrew B. Nobel
    Significance and Recovery of Block Structures in Binary Matrices with Noise. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:109-122 [Conf]
  3. Jinze Liu, Susan Paulsen, Wei Wang, Andrew B. Nobel, Jan Prins
    Mining Approximate Frequent Itemsets from Noisy Data. [Citation Graph (0, 0)][DBLP]
    ICDM, 2005, pp:721-724 [Conf]
  4. Félix Hernández-Campos, Andrew B. Nobel, F. Donelson Smith, Kevin Jeffay
    Understanding Patterns of TCP Connection Usage with Statistical Clustering. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2005, pp:35-44 [Conf]
  5. Jinze Liu, Susan Paulsen, Xing Sun, Wei Wang, Andrew B. Nobel, Jan Prins
    Mining Approximate Frequent Itemsets In the Presence of Noise: Algorithm and Analysis. [Citation Graph (0, 0)][DBLP]
    SDM, 2006, pp:- [Conf]
  6. William T. Barry, Andrew B. Nobel, Fred A. Wright
    Significance analysis of functional categories in gene expression studies: a structured permutation approach. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2005, v:21, n:9, pp:1943-1949 [Journal]
  7. Andrew B. Nobel
    Analysis of a complexity-based pruning scheme for classification trees. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2362-2368 [Journal]
  8. Andrew B. Nobel
    On optimal sequential prediction for general processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:1, pp:83-98 [Journal]
  9. Andrew B. Nobel
    Some stochastic properties of memoryless individual sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:7, pp:1497-1505 [Journal]
  10. Andrew B. Nobel
    Vanishing distortion and shrinking cells. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:4, pp:1303-1305 [Journal]
  11. Andrew B. Nobel
    Recursive partitioning to reduce distortion. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1122-1133 [Journal]
  12. Andrew B. Nobel, Terrence M. Adams
    Estimating a function from ergodic samples with additive noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2895-2902 [Journal]
  13. Andrew B. Nobel, Gusztáv Morvai, Sanjeev R. Kulkarni
    Density Estimation from an Individual Numerical Sequence. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:2, pp:537-541 [Journal]
  14. Andrew B. Nobel, Richard A. Olshen
    Termination and continuity of greedy growing for tree-structured vector quantizers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:191-205 [Journal]
  15. Andrew B. Nobel, Aaron D. Wyner
    A recurrence theorem for dependent processes with applications to data compression. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:5, pp:1561-0 [Journal]

  16. Merging two gene-expression studies via cross-platform normalization. [Citation Graph (, )][DBLP]


  17. FastMap: Fast eQTL mapping in homozygous populations. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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