301 search results - page 2 / 61 » Efficient Sketches for the Set Query Problem |
128
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Motivated by the problem of querying and communicating bidders’ valuations in combinatorial auctions, we study how well different classes of set functions can be sketched. More...
185
click to vote
VLDB
2007
ACM
16 years 17 days ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
122
Voted
DAGM
2010
Springer
15 years 16 days ago
2010
Springer
Content-based image retrieval requires a natural image (e.g, a photo) as query, but the absence of such a query image is usually the reason for a search. An easy way to express the...
101
Voted
PVLDB
2008
14 years 11 months ago
2008
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
177
click to vote
DC
2008
15 years 13 days ago
2008
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...