Sciweavers

868 search results - page 104 / 174
» A general compression algorithm that supports fast searching
Sort
View
152
Voted
CIKM
2009
Springer
15 years 10 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
128
Voted
CIKM
2008
Springer
15 years 5 months ago
Trada: tree based ranking function adaptation
Machine Learned Ranking approaches have shown successes in web search engines. With the increasing demands on developing effective ranking functions for different search domains, ...
Keke Chen, Rongqing Lu, C. K. Wong, Gordon Sun, La...
130
Voted
CIKM
2006
Springer
15 years 7 months ago
A system for query-specific document summarization
There has been a great amount of work on query-independent summarization of documents. However, due to the success of Web search engines query-specific document summarization (que...
Ramakrishna Varadarajan, Vagelis Hristidis
148
Voted
KAIS
2006
164views more  KAIS 2006»
15 years 3 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
143
Voted
PVLDB
2010
146views more  PVLDB 2010»
15 years 2 months ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
Michael Rice, Vassilis J. Tsotras