Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Deniability is defined as a privacy property which enables protocol principals to deny their involvement after they had taken part in a particular protocol run. Lately, Chou et al....
Meng-Hui Lim, Sanggon Lee, Youngho Park, Hoonjae L...
Abstract. Relational algebra is one of the main topics covered in undergraduate computer science database courses. In this paper, we present a web-based tool designed to automatica...
Josep Soler, Imma Boada, Ferran Prados, Jordi Poch...
A tripartite authenticated key agreement protocol is generally designed to accommodate the need of three specific entities in communicating over an open network with a shared secre...
Meng-Hui Lim, Sanggon Lee, Youngho Park, Hoonjae L...
The terminology burr defines undesirable result of plastic deformation formed in machining process causing degradation of the accuracy and functionality of the product and its asse...
Mobile IP (MIP) is designed for supporting mobile nodes. The technology does not sufficiently handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) [1] ensures session conti...
Computational origami is the computer assisted study of origami as a branch of science of shapes. The origami construction is a countably finite sequence of fold steps, each consi...
Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fado...
This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabli...
Masri Ayob, Ariff Md. Ab. Malik, Salwani Abdullah,...
Ubiquitous multimedia services are emerging to be available at anytime and anywhere using a variety of computing devices. In this paper, we propose a low-complexity unequal loss pr...