4110 search results - page 672 / 822 » Efficient algorithms for the 2-gathering problem |
112
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
136
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
The availability and the accuracy of the data dictate the success of a data mining application. Increasingly, there is a need to resort to on-line data collection to address the p...
147
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
136
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
229
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
A growing mount of available text data are being stored in relational databases, giving rise to an increasing need for the RDBMSs to support effective text retrieval. In this pape...