16404 search results - page 2477 / 3281 » A set coverage problem |
199
click to vote
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
155
click to vote
EDBT
2006
ACM
16 years 7 months ago
2006
ACM
Abstract. We study the following problem in a sovereign informationsharing setting: How to ensure that the individual participants, driven solely by self-interest, will behave hone...
219
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
In the paper we discuss the problem of data integration in a P2P environment. In such setting each peer stores schema of its local data, mappings between the schema and schemas of...
199
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
191
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
We address the problem of generating a mediated schema from a set of relational data source schemas and conjunctive queries that specify where those schemas overlap. Unlike past a...