We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Search is a fundamental activity in software development. However, to search source code efficiently, it is not sufficient to implement a traditional full text search over a base ...
— A novel statistical learning algorithm is proposed to accurately analyze volume diagnosis results. This algorithm effectively overcomes the inherent ambiguities in logic diagno...
Huaxing Tang, Manish Sharma, Janusz Rajski, Martin...
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
Web image search using text queries has received considerable attention. However, current state-of-the-art approaches require training models for every new query, and are therefore...
Josip Krapac, Moray Allan, Jakob Verbeek, Frédér...