81 search results - page 8 / 17 » Structuring and Expanding Queries in the Probabilistic Model |
NIPS
2001
14 years 11 months ago
2001
The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by taking into account the link structure of the Web. PageRank assigns to a pa...
BMCBI
2004
14 years 9 months ago
2004
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
112
click to vote
PODS
1998
ACM
15 years 2 months ago
1998
ACM
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
177
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Modeling objects by probability density functions (pdf) is a new powerful method to represent complex objects in databases. By representing an object as a pdf, e.g. a Gaussian, it...
ICVS
2003
Springer
15 years 3 months ago
2003
Springer
This paper presents an extensible architectural model for general content-based analysis and indexing of video data which can be customised for a given problem domain. Video interp...