15073 search results - page 47 / 3015 » Probabilistic algorithms for computing resultants |
VLDB
2007
ACM
15 years 3 months ago
2007
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— When a network of robots or static sensors is emplaced in an environment, the spatial relationships between the sensing units must be inferred or computed for most key applicat...
ENTCS
2008
14 years 9 months ago
2008
: We define and compare several probabilistic notions of computability for mappings from represented spaces (that are equipped with a measure or outer measure) into computable metr...
STACS
1999
Springer
15 years 2 months ago
1999
Springer
We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RPPromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist q...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...