301 search results - page 10 / 61 » Efficient Sketches for the Set Query Problem |
82
Voted
KDD
2008
ACM
15 years 11 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
66
Voted
CCCG
2006
15 years 9 days ago
2006
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...
108
click to vote
EDBT
2010
ACM
15 years 2 months ago
2010
ACM
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
197
click to vote
ICDE
2008
IEEE
16 years 8 days ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
92
Voted
RSCTC
2000
Springer
15 years 2 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...