Page
%P
-
Chapter and Conference Paper
Fast Exact Algorithm to Solve Continuous Similarity Search for Evolving Queries
We study the continuous similarity search problem for evolving queries which has recently been formulated. Given a data stream and a database composed of n sets of items, the purpose of this problem is to maintai...
-
Chapter and Conference Paper
Fast Compression of Large-Scale Hypergraphs for Solving Combinatorial Problems
We present a fast algorithm to compress hypergraphs into the data structure ZDDs. We furthermore analyze the computational complexity. Our algorithm uses multikey Quicksort given by Bentley and Sedgewick. By c...