Sciweavers

779 search results - page 70 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
BMCBI
2010
101views more  BMCBI 2010»
13 years 7 months ago
Hidden Markov model speed heuristic and iterative HMM search procedure
Background: Profile hidden Markov models (profile-HMMs) are sensitive tools for remote protein homology detection, but the main scoring algorithms, Viterbi or Forward, require con...
L. Steven Johnson, Sean R. Eddy, Elon Portugaly
WWW
2002
ACM
14 years 8 months ago
Topic-sensitive PageRank
In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the rel...
Taher H. Haveliwala
IV
2009
IEEE
185views Visualization» more  IV 2009»
14 years 2 months ago
Real-World User Evaluations of a Visual and Interactive Web Search Interface
Although laboratory user studies are the most common method for validating the utility of information visualization systems, it may be difficult to determine if such studies accu...
Orland Hoeber, Daniel Schroeder, Michael Brooks
ICDE
2011
IEEE
217views Database» more  ICDE 2011»
12 years 11 months ago
T-verifier: Verifying truthfulness of fact statements
— The Web has become the most popular place for people to acquire information. Unfortunately, it is widely recognized that the Web contains a significant amount of untruthful inf...
Xian Li, Weiyi Meng, Clement T. Yu
UAI
1990
13 years 9 months ago
Ideal reformulation of belief networks
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for ...
Jack S. Breese, Eric Horvitz