We present UDP datagram demultiplexing techniques that can yield potentially substantial applicationindependent performance gains over BSD-derived UDP implementations. Our demulti...
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
Semantic caching augments cached data with a semantic description of the data. These semantic descriptions can be used to improve execution time for similar queries by retrieving ...
Norvald H. Ryeng, Jon Olav Hauglid, Kjetil N&oslas...
This investigation aims at finding an optimal way of measuring the similarity of melodies. The applicability for an automated analysis and classification was tested on a folk song...