Sciweavers

1940 search results - page 180 / 388
» Optimizing search engines using clickthrough data
Sort
View
PPOPP
2012
ACM
14 years 2 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
ICTIR
2009
Springer
15 years 4 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette
CGO
2004
IEEE
15 years 10 months ago
VHC: Quickly Building an Optimizer for Complex Embedded Architectures
To meet the high demand for powerful embedded processors, VLIW architectures are increasingly complex (e.g., multiple clusters), and moreover, they now run increasingly sophistica...
Michael Dupré, Nathalie Drach, Olivier Tema...
WWW
2007
ACM
16 years 7 months ago
Spam double-funnel: connecting web spammers with advertisers
Spammers use questionable search engine optimization (SEO) techniques to promote their spam links into top search results. In this paper, we focus on one prevalent type of spam ? ...
Yi-Min Wang, Ming Ma, Yuan Niu, Hao Chen
ICDM
2006
IEEE
116views Data Mining» more  ICDM 2006»
16 years 15 days ago
Improving Personalization Solutions through Optimal Segmentation of Customer Bases
On the Web, where the search costs are low and the competition is just a mouse click away, it is crucial to segment the customers intelligently in order to offer more targeted and...
Tianyi Jiang, Alexander Tuzhilin