4332 search results - page 320 / 867 » A Probabilistic Identification Result |
182
Voted
BMCBI
2006
15 years 6 months ago
2006
Markov statistical methods may make it possible to develop an unsupervised learning process that can automatically identify genomic structure in prokaryotes in a comprehensive way...
131
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
143
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
The AncestorRank algorithm calculates an authority score by using just one characteristic of the web graph—the number of ancestors per node. For scalability, we estimate the num...
187
click to vote
BIBE
2007
IEEE
16 years 26 days ago
2007
IEEE
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
190
click to vote
KDD
2005
ACM
16 years 3 days ago
2005
ACM
In this paper, we propose an information retrieval model called Latent Interest Semantic Map (LISM), which features retrieval composed of both Collaborative Filtering(CF) and Prob...