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...
This paper introduces Pact, a new model for parallel heuristic programming on MIMD machines. Designed and implemented as an integrated tool environment, Pact allows the user to dev...
It is a tacit assumption of much linguisticinquiry that alldistinctderivations of a string should assign distinct meanings. But despite the tidinessof such derivational uniqueness...
Analysis of Google Influenza-like-illness (ILI) search queries has shown a strongly correlated pattern with Center for Disease Control and Prevention seasonal ILI reporting data. W...
Courtney Corley, Armin R. Mikler, Karan P. Singh, ...
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...