Sciweavers

361 search results - page 5 / 73
» Maximum subset intersection
Sort
View
SODA
1996
ACM
140views Algorithms» more  SODA 1996»
15 years 1 months ago
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
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...
Richard Cole, Ramesh Hariharan
ENTCS
2002
91views more  ENTCS 2002»
14 years 11 months ago
Subtyping in Logical Form
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...
Ugo de'Liguoro
CVPR
2003
IEEE
16 years 1 months ago
Subset Selection for Efficient SVM Tracking
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...
Shai Avidan
CIKM
2009
Springer
15 years 6 months ago
Relying on topic subsets for system ranking estimation
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,...
TWC
2008
169views more  TWC 2008»
14 years 11 months ago
Antenna subset diversity with non-ideal channel estimation
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...
Wesley M. Gifford, Moe Z. Win, Marco Chiani