4110 search results - page 433 / 822 » Efficient algorithms for the 2-gathering problem |
178
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
325
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
176
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
181
click to vote
AAAI
1993
15 years 8 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
145
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...