We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
Comparing and contrasting is an important strategy people employ to understand new situations and create solutions for new problems. Similar events can provide hints for problem s...
Contextual search refers to proactively capturing the information need of a user by automatically augmenting the user query with information extracted from the search context; for...
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
In this contribution we introduce the Multiocular Contracting Curve Density algorithm (MOCCD), a novel method for fitting a 3D parametric curve. The MOCCD is integrated into a tr...