Sciweavers

3055 search results - page 394 / 611
» Randomized Search Trees
Sort
View
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
15 years 10 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
CSB
2003
IEEE
15 years 9 months ago
Initial Large-scale Exploration of Protein-protein Interactions in Human Brain
Study of protein interaction networks is crucial to post-genomic systems biology. Aided by highthroughput screening technologies, biologists are rapidly accumulating protein-prote...
Jake Yue Chen, Andrey Y. Sivachenko, Russell Bell,...
CIKM
2008
Springer
15 years 6 months ago
Modeling multi-step relevance propagation for expert finding
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
ICASSP
2010
IEEE
15 years 4 months ago
Speech modeling based on committee-based active learning
We propose a committee-based active learning method for large vocabulary continuous speech recognition. In this approach, multiple recognizers are prepared beforehand, and the rec...
Yuzu Hamanaka, Koichi Shinoda, Sadaoki Furui, Tada...
ML
2006
ACM
15 years 4 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik