2922 search results - page 160 / 585 » On Relationships Between Query Models |
154
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...
139
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
135
click to vote
SMA
2006
ACM
15 years 10 months ago
2006
ACM
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
162
click to vote
CLEF
2009
Springer
15 years 5 months ago
2009
Springer
In this study, we describe our system at the Intellectual Property track of the 2009 CrossLanguage Evaluation Forum campaign (CLEF-IP). The CLEF-IP track addressed prior art searc...
162
click to vote
APWEB
2005
Springer
15 years 9 months ago
2005
Springer
When XML documents are modeled as graphs, many challenging research issues arise. In particular, query processing for graphstructured XML data brings new challenges because traditi...