3341 search results - page 146 / 669 » On Bounded Queries and Approximation |
WDAG
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
FCT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
ICDT
1999
ACM
15 years 2 months ago
1999
ACM
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...