9871 search results - page 143 / 1975 » On the Structure of Low Sets |
185
click to vote
IS
2007
15 years 6 months ago
2007
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
162
click to vote
TON
2002
15 years 6 months ago
2002
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
179
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
136
click to vote
CVPR
2009
IEEE
15 years 10 months ago
2009
IEEE
We show that histograms of keypoint descriptor distances can make useful features for visual recognition. Descriptor distances are often exhaustively computed between sets of keyp...
146
click to vote
KRDB
1998
15 years 7 months ago
1998
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...