We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
We present a new window-based method for correspondence search using varying support-weights. We adjust the support-weights of the pixels in a given support window based on color s...
One of the most important and challenging questions in the area of clustering is how to choose the best-fitting algorithm and parameterization to obtain an optiml clustering for t...
Martin Hahmann, Peter Benjamin Volk, Frank Rosenth...
— Data aggregation protocols can reduce the cost of communication, thereby extending the lifetime of sensor networks. Prior work on data aggregation protocols has focused on tree...