Sciweavers

3891 search results - page 555 / 779
» Query Models
Sort
View
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
15 years 10 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
CIKM
2009
Springer
15 years 10 months ago
Easiest-first search: towards comprehension-based web search
Although Web search engines have become information gateways to the Internet, for queries containing technical terms, search results often contain pages that are difficult to be ...
Makoto Nakatani, Adam Jatowt, Katsumi Tanaka
130
Voted
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 9 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
ADBIS
2006
Springer
166views Database» more  ADBIS 2006»
15 years 9 months ago
Clustering-Based Materialized View Selection in Data Warehouses
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
Kamel Aouiche, Pierre-Emmanuel Jouve, Jér&o...
EEE
2005
IEEE
15 years 9 months ago
Feature Selection Methods for Conversational Recommender Systems
This paper focuses on question selection methods for conversational recommender systems. We consider a scenario, where given an initial user query, the recommender system may ask ...
Nader Mirzadeh, Francesco Ricci, Mukesh Bansal