274 search results - page 40 / 55 » Computational complexity of queries based on itemsets |
260
click to vote
ICDE
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
153
click to vote
ICDE
2007
IEEE
16 years 7 days ago
2007
IEEE
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
165
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run...
166
click to vote
ICCV
2007
IEEE
16 years 7 months ago
2007
IEEE
Automatically discovering common visual patterns from a collection of images is an interesting but yet challenging task, in part because it is computationally prohibiting. Althoug...
180
click to vote
SIBGRAPI
2008
IEEE
16 years 8 days ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...