Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
Many data objects in the real world have attributes about location and time. Such spatiotemporal objects can be found in applications such Geographic Information Systems (GIS), env...
In this paper, we propose a new tunable index scheme, called iMinMax, that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Retrieving music from large digital databases is a demanding computational task. The cost for indexing and searching depends not only on the computational effort of measuring music...
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...