Current schema matching approaches still have to improve for large and complex Schemas. The large search space increases the likelihood for false matches as well as execution time...
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
This paper presents experiments on classifying web pages by genre. Firstly, a corpus of 1539 manually labeled web pages was prepared. Secondly, 502 genre features were selected ba...
—Recently researchers have argued that the prevailing view of Web search, as a solitary activity, is flawed: that, in reality, Web search can be an inherently collaborative task...
One method for reducing the time required for plan generation is to learn search control rules from experience. Most of the recent work in learning search control knowledge has co...