“Papers of School of Computer Science”
On drawing of free trees on 2d grids which are bounded by simple polygons,
13(2006), 387-394 [abstract]
72. R. Khosravi and M. Ghodsi,
Shortest Paths with Single-Point Visibility Constraint,
13(2006), 25-32 [abstract]
73. A. Khonsari and M. Ould_Khaoua,
A performance model of compressionless routing in k-ary n-cube networks,
Performance Evaluation 63(2006), 423-440 [abstract]
74. A. Masoudnia, H. Sarbazi-Azad and S. Boussakta,
Design and performance of a pixel-level pipelined-parallel architecture for high speed wavelet-based image compression,
Computers & Electrical Engineering 31(2005), 572-588 [abstract]
75. H.R. Zarandi and H. Sarbazi-Azad,
Hierarchical binary set partitioning in cache memories,
The Journal of Supercomputing 31(2005), 185-202 [abstract]
76. H. Sarbazi-Azad and M. Ould-Khaoua,
Constraint-based performance analysis of k-ary n-cube networks,
International Journal of Computers and Their Applications 12(2005), 83-92 [abstract]
77. A. Masoudnia, H. Sarbazi-Azad and S. Boussakta,
A pixel level pipelined parallel architecture for wavelet based image compression: design, implementation, performance,
Computers & Electrical Engineering 31(2005), 572-588 [abstract]
78. H. Beigy,
Asynchronous cellular learning automata,
(2005), [abstract]
79. H. Beigy and M. R. Meybodi,
An adaptive call admission algorithm for cellular networks,
Computers & Electrical Engineering 31(2005), 132-151 [abstract]
80. H. Beigy and M. R. Meybodi,
A general call admission policy for next generation wireless networks,
Computer Communications 28(2005), 1798-1813 [abstract]
back to top
