Sciweavers

1940 search results - page 133 / 388
» Optimizing search engines using clickthrough data
Sort
View
UIST
1995
ACM
14 years 1 months ago
Multiple-View Approach for Smooth Information Retrieval
Although various visualization techniques have been proposed for information retrieval tasks, most of them are based on a single strategy for viewing and navigating through the in...
Toshiyuki Masui, Mitsuru Minakuchi, George R. Bord...
TJS
2002
160views more  TJS 2002»
13 years 9 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
SIGSOFT
2009
ACM
14 years 11 months ago
DebugAdvisor: a recommender system for debugging
In large software development projects, when a programmer is assigned a bug to fix, she typically spends a lot of time searching (in an ad-hoc manner) for instances from the past ...
B. Ashok, Joseph M. Joy, Hongkang Liang, Sriram K....
JACM
2007
132views more  JACM 2007»
13 years 10 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
14 years 2 months ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang