6615 search results - page 140 / 1323 » Indexing Multiple Sets |
160
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
136
click to vote
EDBT
2009
ACM
15 years 12 months ago
2009
ACM
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
156
click to vote
ECCV
2002
Springer
16 years 7 months ago
2002
Springer
There has been considerable success in automated reconstruction for image sequences where small baseline algorithms can be used to establish matches across a number of images. In c...
149
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
This paper introduces a very compact yet discriminative video description, which allows example-based search in a large number of frames corresponding to thousands of hours of vide...
145
click to vote
SSD
1999
Springer
15 years 9 months ago
1999
Springer
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...