176 search results - page 4 / 36 » On the analysis of queries with counting constraints |
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
SIGMOD
2012
ACM
11 years 11 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
TKDE
2010
13 years 7 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
RTSS
2005
IEEE
14 years 2 months ago
2005
IEEE
Recently there has been a growing interest in models and methods targeted towards the (co)design of stream processing applications; e.g. those for audio/video processing. Streams ...
ALGORITHMICA
2007
13 years 8 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...