3368 search results - page 473 / 674 » The Complexity of Query Reliability |
173
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
194
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
199
click to vote
BIBM
2009
IEEE
16 years 1 months ago
2009
IEEE
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
151
click to vote
AIRS
2009
Springer
16 years 1 months ago
2009
Springer
Relevance-based language models operate by estimating the probabilities of observing words in documents relevant (or pseudo relevant) to a topic. However, these models assume that ...
192
click to vote
SIBGRAPI
2008
IEEE
16 years 25 days ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...