The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
+ XOM-based secure processor has recently been introduced as a mechanism to provide copy and tamper resistant execution. XOM provides support for encryption/decryption and integrit...
Deformable models are an attractive approach to recognizing nonrigid objects which have considerable within class variability. However, there are severe search problems associated...
Christopher K. I. Williams, Michael Revow, Geoffre...
Mutation-based Evolutionary Algorithms, also known as Evolutionary Programming (EP) are commonly applied to Artificial Neural Networks (ANN) parameters optimization. This paper pre...
Kristina Davoian, Alexander Reichel, Wolfram-Manfr...
Memory managers are an important part of any modern language: they are used to dynamically allocate memory for use in the program. Many managers exist and depending on the operati...
Yves Younan, Wouter Joosen, Frank Piessens, Hans V...