Sciweavers

3652 search results - page 43 / 731
» A study of query length
Sort
View
GIS
2005
ACM
14 years 8 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
14 years 1 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
CIKM
2005
Springer
14 years 1 months ago
Web-centric language models
We investigates language models for informational and navigational web search. Retrieval on the web is a task that differs substantially from ordinary ad hoc retrieval. We perfor...
Jaap Kamps
IPM
2002
107views more  IPM 2002»
13 years 7 months ago
Combining evidence for automatic Web session identification
Contextual information provides an important basis for identifying and understanding users' information needs. Our previous work in traditional information retrieval systems ...
Daqing He, Ayse Göker, David J. Harper
DOLAP
1999
ACM
14 years 2 days ago
Design and Selection of Materialized Views in a Data Warehousing Environment: A Case Study
In this paper, we describe the design of a data warehousing system for an engineering company ‘R’. This system aims to assist users in retrieving data for business analysis in...
Goretti K. Y. Chan, Qing Li, Ling Feng