Sciweavers

2127 search results - page 39 / 426
» Computing large matchings fast
Sort
View
WWW
2009
ACM
16 years 4 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
119
Voted
WWW
2009
ACM
16 years 4 months ago
Online expansion of rare queries for sponsored search
Sponsored search systems are tasked with matching queries to relevant advertisements. The current state-of-the-art matching algorithms expand the user's query using a variety...
Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovi...
138
Voted
ICIP
2000
IEEE
16 years 5 months ago
Fast Retrieval Methods for Images with Significant Variations
Fast image retrieval is the key to success for operations on large image databases, and a great many techniques have been developed for efficient retrieval. However, most of these...
Paul W. Fieguth, Riyin Wan
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 8 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
16 years 3 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010