Sciweavers

779 search results - page 81 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
ICDE
2000
IEEE
82views Database» more  ICDE 2000»
16 years 7 months ago
Similarity Search for Multidimensional Data Sequences
Time-series data, which are a series of one-dimensional real numbers, have been studied in various database applications. In this paper, we extend the traditional similarity searc...
Seok-Lyong Lee, Seok-Ju Chun, Deok-Hwan Kim, Ju-Ho...
WWW
2007
ACM
16 years 7 months ago
Estimating the cardinality of RDF graph patterns
Most RDF query languages allow for graph structure search through a conjunction of triples which is typically processed using join operations. A key factor in optimizing joins is ...
Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Pau...
SIROCCO
2004
15 years 7 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
Stefan Dobrev, Paola Flocchini, Nicola Santoro
WEBI
2010
Springer
15 years 4 months ago
Ranking Approaches for Microblog Search
Ranking microblogs, such as tweets, as search results for a query is challenging, among other things because of the sheer amount of microblogs that are being generated in real time...
Rinkesh Nagmoti, Ankur Teredesai, Martine De Cock
IPPS
2007
IEEE
16 years 17 days ago
Popularity Adaptive Search in Hybrid P2P Systems
In a hybrid peer-to-peer (P2P) system, flooding and DHT are both employed for content locating. The decision to use flooding or DHT largely depends on the population of desired da...
Xiaoqiu Shi, Jinsong Han, Yunhao Liu, Lionel M. Ni