Sciweavers

771 search results - page 63 / 155
» Methods for Measuring Search Engine Performance over Time
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 3 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SIGIR
2008
ACM
13 years 10 months ago
Modeling expert finding as an absorbing random walk
We introduce a novel approach to expert finding based on multi-step relevance propagation from documents to related candidates. Relevance propagation is modeled with an absorbing ...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
ISORC
2003
IEEE
14 years 3 months ago
Enhancing Time Triggered Scheduling with Value Based Overload Handling and Task Migration
Time triggered methods provide deterministic behaviour suitable for critical real-time systems. They perform less favourably, however, if the arrival times of some activities are ...
Jan Carlson, Tomas Lennvall, Gerhard Fohler
AIPS
2010
14 years 14 days ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
WSDM
2012
ACM
243views Data Mining» more  WSDM 2012»
12 years 5 months ago
No search result left behind: branching behavior with browser tabs
Today’s Web browsers allow users to open links in new windows or tabs. This action, which we call ‘branching’, is sometimes performed on search results when the user plans t...
Jeff Huang, Thomas Lin, Ryen W. White