137 search results - page 7 / 28 » Probabilistic algorithm for finding roots of linearized poly... |
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
We propose a geometric approach to 3-D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the ...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
CC
2007
Springer
13 years 7 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
ICDE
2008
IEEE
14 years 1 months ago
2008
IEEE
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...