We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
— We are currently witnessing an increasing interest in the use of the web as an information and knowledge source. Much of the information sought after in the web is in this case...
Heiko Stoermer, Themis Palpanas, George Giannakopo...
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
This paper reports on a case study of a teacher from a technical education institution who explored the educational affordances of PDA technology over a period of six months. Base...
This survey covers the historical development and current state of the art in image understanding for iris biometrics. Most research publications can be categorized as making thei...
Kevin W. Bowyer, Karen Hollingsworth, Patrick J. F...