Sciweavers

406 search results - page 35 / 82
» Dominating Sets in Web Graphs
Sort
View
CVPR
2011
IEEE
13 years 4 months ago
Noise Resistant Graph Ranking for Improved Web Image Search
In this paper, we exploit a novel ranking mechanism that processes query samples with noisy labels, motivated by the practical application of web image search re-ranking where the...
Wei Liu, Yu-Gang Jiang, Jiebo Luo, Shih-Fu Chang
TAMC
2009
Springer
14 years 3 months ago
On Parameterized Exponential Time Complexity
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
Jianer Chen, Iyad A. Kanj, Ge Xia
WWW
2009
ACM
14 years 9 months ago
Unsupervised query categorization using automatically-built concept graphs
Automatic categorization of user queries is an important component of general purpose (Web) search engines, particularly for triggering rich, query-specific content and sponsored ...
Eustache Diemert, Gilles Vandelle
WWW
2004
ACM
14 years 9 months ago
Efficient pagerank approximation via graph aggregation
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Ja...
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
14 years 21 days ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn