A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
An essential problem for biologists is the processing and evaluation of BLAST results. We advocate the deployment of database technology and describe a userdriven tool, called Bla...
William G. Farmerie, Joachim Hammer, Li Liu, Marku...
This paper introduces a new data structure, called V-trees, designed to store long sequences of points in 2D space and yet allow efficient access to their fragments. They also opt...
Prediction error identification requires that data be informative with respect to the chosen model structure. Whereas sufficient conditions for informative experiments have been av...
Michel Gevers, Alexandre S. Bazanella, Ljubisa Mis...