Sciweavers

395 search results - page 26 / 79
» Towards a theory of search queries
Sort
View
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 9 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
HT
2010
ACM
13 years 9 months ago
Adaptation and search: from Dexter and AHAM to GAF
Adaptive Hypermedia Systems (AHS) have long been concentrating on adaptive guidance of links between domain concepts. Here we show parallels between navigation and linking in adap...
Evgeny Knutov, Paul De Bra, Mykola Pechenizkiy
CIKM
2005
Springer
14 years 2 months ago
Concept-based interactive query expansion
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
Bruno M. Fonseca, Paulo Braz Golgher, Bruno P&ocir...
SEMWEB
2009
Springer
14 years 3 months ago
Using Naming Authority to Rank Data and Ontologies for Web Search
Abstract. The focus of web search is moving away from returning relevant documents towards returning structured data as results to user queries. A vital part in the architecture of...
Andreas Harth, Sheila Kinsella, Stefan Decker
DAWAK
2009
Springer
14 years 27 days ago
Skyline View: Efficient Distributed Subspace Skyline Computation
Skyline queries have gained much attention as alternative query semantics with pros (e.g.low query formulation overhead) and cons (e.g.large control over result size). To overcome ...
Jinhan Kim, Jongwuk Lee, Seung-won Hwang