Sciweavers

86 search results - page 10 / 18
» Efficient querying of distributed provenance stores
Sort
View
65
Voted
PODS
2003
ACM
113views Database» more  PODS 2003»
15 years 9 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
ISMIR
2000
Springer
176views Music» more  ISMIR 2000»
15 years 1 months ago
SEMEX - An efficient Music Retrieval Prototype
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...
Kjell Lemström, S. Perttu
DAGSTUHL
2004
14 years 11 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
DFN
2003
14 years 11 months ago
High-Efficient Intrusion Detection Infrastructure
In recent years research activities in computer network security focus more actively on the development of effective methods in intrusion detection. The reason for this developmen...
Thomas Holz, Michael Meier, Hartmut König
IFIP
2010
Springer
14 years 4 months ago
Resource Adaptive Distributed Information Sharing
We have designed, implemented and evaluated a resource adaptive distributed information sharing system where automatic adjustments are made internally in our information sharing sy...
Hans Vatne Hansen, Vera Goebel, Thomas Plagemann, ...