5221 search results - page 262 / 1045 » An On-line Problem Database |
196
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
205
click to vote
EDBT
2012
ACM
13 years 9 months ago
2012
ACM
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
163
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
190
click to vote
SIGMOD
2012
ACM
13 years 9 months ago
2012
ACM
We consider the problem of finding related tables in a large corpus of heterogenous tables. Detecting related tables provides users a powerful tool for enhancing their tables wit...