Are probability estimates from the permutation model of Mantel's test stable?JACKSON, D. A; SOMERS, K. M.Canadian journal of zoology. 1989, Vol 67, Num 3, pp 766-769, issn 0008-4301, 4 p.Article

The effect of teaching via telecommunications : a comparison of the academic performance of RN-BSN students in satellite centers and on campusDALY, Jeanette-M; MCCLELLAND, Eleanor; YANG, June et al.JOURNAL OF NURSING EDUCATION. 1994, Vol 33, Num 4, pp 172-174Article

The effect of teaching via telecommunications : a comparison of the academic performance of RN-BSN students in satellite centers and on campusDALY, Jeanette-M; MCCLELLAND, Eleanor; YANG, June et al.JOURNAL OF NURSING EDUCATION. 1994, Vol 33, Num 4, pp 172-174Article

Bounds for the cardinality of codes with given distance and diameter in polynomial metric spaces¹FAZEKAS, Gabor.International conference on advances in communication and control. 2002, pp 47-50, isbn 0-911575-78-2, 4 p.Conference Paper

Hybridation GPS-Loran C : aspect géométrique = Combining GPS and LORAN C: geometrical problemsMOUSSA, R.Navigation (Paris). 1990, Vol 38, Num 151, pp 361-370, issn 0028-1530, 10 p.Article

The total variation distance between the binomial and Poisson distributionsKENNEDY, J. E; QUINE, M. P.Annals of probability. 1989, Vol 17, Num 1, pp 396-400, issn 0091-1798, 5 p.Article

Designing good permutations for turbo codes : towards a single modelBERROU, C; SAOUTER, Y; DOUILLARD, C et al.IEEE International Conference on Communications. 2004, isbn 0-7803-8533-0, vol1, 341-345Conference Paper

A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codesHOLLMANN, H. D. L.IEEE transactions on information theory. 1993, Vol 39, Num 4, pp 1424-1427, issn 0018-9448Article

Bandpass line codes for q-ary alphabetsPERKINS, S.Electronics Letters. 1993, Vol 29, Num 20, pp 1740-1741, issn 0013-5194Article

On the Feng-Rao Bound for Generalized Hamming WeightsGEIL, Olav; THOMMESEN, Christian.Lecture notes in computer science. 2006, pp 295-306, issn 0302-9743, isbn 3-540-31423-7, 1Vol, 12 p.Conference Paper

Separating partition systems and locally different sequencesKORNER, J; SIMONYI, G.SIAM journal on discrete mathematics. 1988, Vol 1, Num 3, pp 355-359Article

Overtaking on migration: does longer distance migration always incur a penalty?ALVES, Jose A; GUNNARSSON, Tómas G; POTTS, Peter M et al.Oikos. 2012, Vol 121, Num 3, pp 464-470, issn 0030-1299, 7 p.Article

Mean focal length of an aberrated lensMAFUSIRE, Cosmas; FORBES, Andrew.Journal of the Optical Society of America. A, Optics, image science, and vision (Print). 2011, Vol 28, Num 7, pp 1403-1409, issn 1084-7529, 7 p.Article

A practical method for exact computation of subtree prune and regraft distanceYUFENG WU.Bioinformatics (Oxford. Print). 2009, Vol 25, Num 2, pp 190-196, issn 1367-4803, 7 p.Article

Manager à distance, un équilibre entre confiance et vigilanceLARVOR, Claire.SOINS. CADRES. 2013, Num 86, pp S11-S13, issn 0183-2980, SupplArticle

Xwalk: computing and visualizing distances in cross-linking experimentsKAHRAMAN, Abdullah; MALMSTRÖM, Lars; AEBERSOLD, Ruedi et al.Bioinformatics (Oxford. Print). 2011, Vol 27, Num 15, pp 2163-2164, issn 1367-4803, 2 p.Article

An investigation of the meaning of near and close on a university campus = Etude du sens de «près de» et de «à côté de» dans un campus universitaireFISHER, P. F; ORF, T. M.Computers, environment and urban systems. 1991, Vol 15, Num 1-2, pp 23-35, issn 0198-9715, 13 p.Article

Classification of the European language families by genetic distanceHARDING, R. M; SOKAL, R. R.Proceedings of the National Academy of Sciences of the United States of America. 1988, Vol 85, Num 23, pp 9370-9372, issn 0027-8424Article

Efficient simulation of multidimensional communication systems by sample rejectionLOSKOT, Pavel; BEAULIEU, Norman C.IEEE International Conference on Communications. 2004, isbn 0-7803-8533-0, vol4, 2240-2245Conference Paper

Sphere-packing bounds in the grassmann and stiefel manifoldsHENKEL, Oliver.IEEE transactions on information theory. 2005, Vol 51, Num 10, pp 3445-3456, issn 0018-9448, 12 p.Article

A new bound for the minimum distance of a cyclic code from its defining setBETTI, Emanuele; SALA, Massimiliano.IEEE transactions on information theory. 2006, Vol 52, Num 8, pp 3700-3706, issn 0018-9448, 7 p.Article

Asymmetric q-ary error locating codes for character recognitionSAOWAPA, K; FUJIWARA, E.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 265Conference Paper

Distance et proximité dans la relation professionnel/enfantMONELLO HOUSSIN, Silvana.METIERS DE LA PETITE ENFANCE. 2011, Num 172, pp 14-16, issn 1258-780X, 3 p.Article

Efficient estimation of pairwise distances between genomesDOMAZET-LOSO, Mirjana; HAUBOLD, Bernhard.Bioinformatics (Oxford. Print). 2009, Vol 25, Num 24, pp 3221-3227, issn 1367-4803, 7 p.Article

Etude de l'indice d'hétérosis synthétiqueFU AIJUN.Yíchuán xuébào. 1987, Vol 14, Num 6, pp 436-441, issn 0379-4172Article