Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
Brandon W. Higgs, Jennifer W. Weller, Jeffrey L. S...
We propose a structured approach to the problem of retrieval of images by content and present a description logic that has been devised for the semantic indexing and retrieval of ...
Eugenio Di Sciascio, Francesco M. Donini, Marina M...
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...