Sciweavers

779 search results - page 42 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
GBRPR
2009
Springer
14 years 8 days ago
From Random to Hierarchical Data through an Irregular Pyramidal Structure
This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time...
Rimon Elias, Mohab Al Ashraf, Omar Aly
INFOCOM
2011
IEEE
12 years 11 months ago
Continuous multi-dimensional top-k query processing in sensor networks
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
Hongbo Jiang, Jie Cheng, Dan Wang, Chonggang Wang,...
PVLDB
2008
232views more  PVLDB 2008»
13 years 6 months ago
FINCH: evaluating reverse k-Nearest-Neighbor queries on location data
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...
Wei Wu, Fei Yang, Chee Yong Chan, Kian-Lee Tan
IC
2003
13 years 9 months ago
An Analysis of Web Documents Retrieved and Viewed
The placement of Websites in ranked retrieval and the viewing patterns of Web search engine users is a crucial issue for Web site owners and Web search engines. However, little la...
Bernard J. Jansen, Amanda Spink
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
An Enhanced Search Technique for Managing Partial Coverage and Free Riding in P2P Networks
This paper presents a Q-learning based scheme for managing the partial coverage problem and the ill effects of free riding in unstructured P2P networks. Based on various parameter ...
Sabu M. Thampi, K. Chandra Sekaran