Sciweavers

441 search results - page 39 / 89
» Query expansion using random walk models
Sort
View
ECIR
2007
Springer
13 years 11 months ago
Enhancing Expert Search Through Query Modeling
An expert finding is a very common task among enterprise search activities, while its usual retrieval performance is far from the quality of the Web search. Query modeling helps t...
Pavel Serdyukov, Sergey Chernov, Wolfgang Nejdl
WWW
2008
ACM
14 years 10 months ago
Using the wisdom of the crowds for keyword generation
In the sponsored search model, search engines are paid by businesses that are interested in displaying ads for their site alongside the search results. Businesses bid for keywords...
Ariel Fuxman, Panayiotis Tsaparas, Kannan Achan, R...
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 10 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
AAAI
2008
13 years 11 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
SPAA
2009
ACM
14 years 10 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman