Journal Publications

You may browse collection of community or use the search tool below

Last Submissions

	3871-3885 out of 5125 results
3871	G. N. Karystinos and D. A. Pados, “Rank-2-optimal adaptive design of binary spreading codes,” IEEE Transactions on information Theory, vol. 53, no. 9, pp. 3075 - 3080, Sept. 2007. doi: 10.1109/TIT.2007.903130	2015-10-23
3872	P. Panagiotopoulou, D.I. Kondarides, “A comparative study of the water-gas shift activity of Pt catalysts supported on single (MOx) and composite (MOx/Al2O3, MOx/TiO2) metal oxide carriers”, Catalysis Today,Vol. 127, no.1-4,pp. 319-329, Sep.2007. doi:10.1016/j.cattod.2007.05.010.	2015-10-23
3873	D. S. Papailiopoulos and G. N. Karystinos, “Maximum-likelihood noncoherent OSTBC detection with polynomial complexity,” IEEE Transactions on Wireless Communications, vol. 9, no. 6, pp. 1935 - 1945, Jun. 2010. doi: 10.1109/TWC.2010.06.081715	2015-10-23
3874	Tzanakakis, V.E., Paranychianakis, N.V., Angelakis, A.N., "Effluentapplication to the land: Changes in soil properties and treatment potential" Ecological Engineering Vol. 37, no. 11, pp. 1757-1764, Nov. 2001. DOI: 10.1016/j.ecoleng.2011.06.024	2015-10-23
3875	G. N. Karystinos and A. P. Liavas, “Efficient computation of the binary vector that maximizes a rank-deficient quadratic form,” IEEE Transactions on Information Theory, vol. 56, no. 7, pp. 3581 - 3593, Jul. 2010. doi: 10.1109/TIT.2010.2048450	2015-10-23
3876	H. Ganapathy, D. A. Pados, and G. N. Karystinos, “New bounds and optimal binary signature sets-Part I: Periodic total squared correlation,” IEEE Transactions on Communications, vol. 59,no. 4, pp. 1123 - 1132, Apr. 2011. doi: 10.1109/TCOMM.2011.020411.090404	2015-10-23
3877	H. Ganapathy, D. A. Pados, and G. N. Karystinos, “New bounds and optimal binary signature sets-Part II: Aperiodic total squared correlation,” IEEE Transactions on Communications, vol. 59, no. 5, pp. 1411 - 1420, May.2011. doi: 10.1109/TCOMM.2011.020811.090405	2015-10-23
3878	K. R. Dalbey and G. N. Karystinos, “Generating a maximally spaced set of bins to fill for high-dimensional space-filling Latin hypercube sampling," International Journal for Uncertainty Quantification, vol. 1, no. 3, pp. 241-255, Jul. 2011. doi: 10.1615/Int.J.UncertaintyQuantification.v1.i3.40	2015-10-23
3879	A. Bletsas, J. Kimionis, A. G. Dimitriou, and G. N. Karystinos, "Single-antenna coherent detection of collided FM0 RFID signals," IEEE Transactions on Communications, vol. 60, no. 3, pp. 756 - 766, Mar. 2012. doi: 10.1109/TCOMM.2011.020612.110212	2015-10-23
3880	D. S. Papailiopoulos, G. Abou Elkheir, and G. N. Karystinos,"Maximum-likelihood noncoherent PAM detection," IEEE Transactions on Communications, vol. 61, no. 3, pp. 1152 - 1159, Mar. 2013. doi: 10.1109/TCOMM.2012.010913.120448	2015-10-23
3881	A. Kyrillidis and G. N. Karystinos,"Fixed-rank rayleigh quotient maximization by an MPSK sequence," IEEE Transactions on Communications, vol. 62, no. 3, pp. 961 - 975, Mar. 2014. doi: 10.1109/TCOMM.2014.012414.130439	2015-10-23
3882	M. Asteris, D. S. Papailiopoulos, and G. N. Karystinos, "The sparse principal component of a constant-rank matrix," IEEE Transactions on Information Theory,vol. 60, no. 4, pp. 2281 - 2290, Apr. 2014. doi: 10.1109/TIT.2014.2303975	2015-10-23
3883	P. P. Markopoulos, G. N. Karystinos, and D. A. Pados, "Optimal algorithms for L1 -subspace signal processing," IEEE Transactions on Signal Processing, vol. 62, no. 19, pp. 5046 - 5058, Oct. 2014. doi: 10.1109/TSP.2014.2338077	2015-10-23
3884	M. Gkizeli and G. N. Karystinos,"Maximum-SNR antenna selection among a large number of transmit antennas," IEEE Journal of Selected Topics in Signal Processing, vol. 8, no. 5, pp. 891 - 901, Oct. 2014. doi: 10.1109/JSTSP.2014.2328329	2015-10-23
3885	Paranychianakis, N.V., Angelakis, A.N., 2008 "Water stress and rootstock affectedthe development of leaf burns in grapevines irrigated with saline effluent"Agricultural Water Management Vol. 95, no. 4, pp. 375-382, Apr. 2008. DOI: 10.1016/j.agwat.2007.10.019	2015-10-23
Pages: \|...254 \|255 \|256 \|257 \|258 \| 259 \|260 \|261 \|262 \|263 \|264 \|...