We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
This paper evaluates the potential impact of explicit phrases on retrieval quality through a case study with the TREC Terabyte benchmark. It compares the performance of user- and s...
—We provide a novel search technique which uses a hierarchical model and a mutual information gain heuristic to efficiently prune the search space when localizing faces in images...
Following the ideas of stronger forms of monotonicity for unary real functions and for capacities, k-monotone and strongly kmonotone aggregation functions are introduced and discus...
Are we interested in choice functions or function for choice? Was it my choice or did I choose? In the end it is all about sorts and operators, terms as given by the term monad ove...