5221 search results - page 613 / 1045 » An On-line Problem Database |
187
click to vote
EDBT
2002
ACM
16 years 7 months ago
2002
ACM
The problem of finding contained rewritings of queries using views is of great importance in mediated data integration systems. In this paper, we first present a general approach f...
196
click to vote
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
151
click to vote
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
195
click to vote
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
184
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...