ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
Click based graphical passwords that use background images suffer from hot-spot problem. Previous graphical password schemes based on recognition of images do not have a sufficient...
Kemal Bicakci, Nart Bedin Atalay, Mustafa Yuceel, ...
Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimiz...
Alakananda Bhattacharya, Amit Konar, Swagatam Das,...
This paper is concerned with the study of a class of prox-penalization methods for solving variational inequalities of the form Ax + NC (x) 0 where H is a real Hilbert space, A : H...
Hedy Attouch, Marc-Olivier Czarnecki, Juan Peypouq...
Several works on grid computing have been proposed in the last years. However, most of them, including available software, can not deal properly with some issues related to contro...