173 search results - page 19 / 35 » Efficient Rank Based KNN Query Processing Over Uncertain Dat... |
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
SIGIR
2010
ACM
13 years 11 months ago
2010
ACM
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...