The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
We update the SVM score of an object through a video sequence with a small and variable subset of support vectors. In the first frame we use all the support vectors to compute the...
Ranking a number of retrieval systems according to their retrieval effectiveness without relying on costly relevance judgments was first explored by Soboroff et al [6]. Over th...
Claudia Hauff, Djoerd Hiemstra, Franciska de Jong,...
In modern wireless systems employing diversity techniques, combining all the available diversity branches may not be feasible due to complexity and resource constraints. To allevia...