3341 search results - page 403 / 669 » On Bounded Queries and Approximation |
182
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
182
click to vote
WAW
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
173
click to vote
ISCC
2006
IEEE
16 years 20 days ago
2006
IEEE
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...
200
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
225
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...