AAAAAA

   
Results: 1-20 |
Results: 20

Authors: DEVROYE L
Citation: L. Devroye, UNIVERSAL LIMIT LAWS FOR DEPTHS IN RANDOM TREES, SIAM journal on computing (Print), 28(2), 1999, pp. 409-432

Authors: AVIS D BERESFORDSMITH B DEVROYE L ELGINDY H GUEVREMONT E HURTADO F ZHU BH
Citation: D. Avis et al., UNORIENTED THETA-MAXIMA IN THE PLANE - COMPLEXITY AND ALGORITHMS, SIAM journal on computing (Print), 28(1), 1999, pp. 278-296

Authors: DEVROYE L GOUDJIL A
Citation: L. Devroye et A. Goudjil, A STUDY OF RANDOM WEYL TREES, Random structures & algorithms, 12(3), 1998, pp. 271-295

Authors: DEVROYE L MUCKE EP ZHU BH
Citation: L. Devroye et al., A NOTE ON POINT LOCATION IN DELAUNAY TRIANGULATIONS OF RANDOM POINTS, Algorithmica, 22(4), 1998, pp. 477-482

Authors: DEVROYE L GYORFI L KRZYZAK A
Citation: L. Devroye et al., THE HILBERT KERNEL REGRESSION ESTIMATE, Journal of Multivariate Analysis, 65(2), 1998, pp. 209-227

Authors: DEVROYE L
Citation: L. Devroye, ON THE RICHNESS OF THE COLLECTION OF SUBTREES IN RANDOM BINARY SEARCH-TREES, Information processing letters, 65(4), 1998, pp. 195-199

Authors: DEVROYE L KRUSZEWSKI P
Citation: L. Devroye et P. Kruszewski, ON THE HORTON-STRAHLER NUMBER FOR RANDOM TRIES, Informatique theorique et applications, 30(5), 1996, pp. 443-456

Authors: CAO R DEVROYE L
Citation: R. Cao et L. Devroye, THE CONSISTENCY OF A SMOOTHED MINIMUM DISTANCE ESTIMATE, Scandinavian journal of statistics, 23(4), 1996, pp. 405-418

Authors: DEVROYE L LUGOSI G
Citation: L. Devroye et G. Lugosi, A UNIVERSALLY ACCEPTABLE SMOOTHING FACTOR FOR KERNEL DENSITY ESTIMATES, Annals of statistics, 24(6), 1996, pp. 2499-2512

Authors: DEVROYE L LU J
Citation: L. Devroye et J. Lu, THE STRONG-CONVERGENCE OF MAXIMAL DEGREES IN UNIFORM RANDOM RECURSIVETREES AND DAGS, Random structures & algorithms, 7(1), 1995, pp. 1-14

Authors: BERLINET A DEVROYE L GYORFI L
Citation: A. Berlinet et al., ASYMPTOTIC NORMALITY OF L(1)-ERROR IN DENSITY-ESTIMATION, Statistics, 26(4), 1995, pp. 329-343

Authors: DEVROYE L ROBSON JM
Citation: L. Devroye et Jm. Robson, ON THE GENERATION OF RANDOM BINARY SEARCH-TREES, SIAM journal on computing, 24(6), 1995, pp. 1141-1156

Authors: DEVROYE L REED B
Citation: L. Devroye et B. Reed, ON THE VARIANCE OF THE HEIGHT OF RANDOM BINARY SEARCH-TREES, SIAM journal on computing, 24(6), 1995, pp. 1157-1162

Authors: DEVROYE L LUGOSI G
Citation: L. Devroye et G. Lugosi, LOWER BOUNDS IN PATTERN-RECOGNITION AND LEARNING, Pattern recognition, 28(7), 1995, pp. 1011-1018

Authors: DEVROYE L KRUSZEWSKI P
Citation: L. Devroye et P. Kruszewski, A NOTE ON THE HORTON-STRAHLER NUMBER FOR RANDOM TREES, Information processing letters, 56(2), 1995, pp. 95-99

Authors: DEVROYE L
Citation: L. Devroye, ON RANDOM CARTESIAN TREES, Random structures & algorithms, 5(2), 1994, pp. 305-327

Authors: DEVROYE L GYORFI L KRZYZAK A LUGOSI G
Citation: L. Devroye et al., ON THE STRONG UNIVERSAL CONSISTENCY OF NEAREST-NEIGHBOR REGRESSION FUNCTION ESTIMATES, Annals of statistics, 22(3), 1994, pp. 1371-1385

Authors: DEVROYE L
Citation: L. Devroye, ON GOOD DETERMINISTIC SMOOTHING SEQUENCES FOR KERNEL DENSITY, Annals of statistics, 22(2), 1994, pp. 886-889

Authors: DEVROYE L KRUSZEWSKI P
Citation: L. Devroye et P. Kruszewski, A NOTE ON THE HORTON-STRAHLER NUMBER FOR RANDOM TREES, Information processing letters, 52(3), 1994, pp. 155-159

Authors: DEVROYE L
Citation: L. Devroye, ON THE EXPECTED HEIGHT OF FRINGE-BALANCED TREES, Acta informatica, 30(5), 1993, pp. 459-466
Risultati: 1-20 |