Sciweavers

779 search results - page 65 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
JUCS
2006
225views more  JUCS 2006»
13 years 7 months ago
Restricting the View and Connecting the Dots - Dangers of a Web Search Engine Monopoly
: Everyone realizes how powerful the few big Web search engine companies have become, both in terms of financial resources due to soaring stock quotes and in terms of the still hid...
Narayanan Kulathuramaiyer, Wolf-Tilo Balke
ISMIR
2000
Springer
128views Music» more  ISMIR 2000»
13 years 11 months ago
PROMS: A Web-based Tool for Searching in Polyphonic Music
One major task of a digital music library (DML) is to provide techniques to locate a queried musical pattern in all pieces of music in the database containing that pattern. For a ...
Michael Clausen, R. Engelbrecht, D. Meyer, J. Schm...
SAC
2009
ACM
14 years 2 months ago
Diverse peer selection in collaborative web search
Effective peer selection for intelligent query routing is a challenge in collaborative peer-based Web search systems, especially unstructured networks that do not have any central...
Le-Shin Wu, Filippo Menczer
BMCBI
2007
148views more  BMCBI 2007»
13 years 7 months ago
Blast sampling for structural and functional analyses
Background: The post-genomic era is characterised by a torrent of biological information flooding the public databases. As a direct consequence, similarity searches starting with ...
Anne Friedrich, Raymond Ripp, Nicolas Garnier, Emm...