15073 search results - page 244 / 3015 » Probabilistic algorithms for computing resultants |
134
click to vote
DAM
2007
15 years 4 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
132
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
146
click to vote
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
129
click to vote
TCS
2008
15 years 4 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
191
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
This paper deals with estimation of dense optical flow
and ego-motion in a generalized imaging system by exploiting
probabilistic linear subspace constraints on the flow.
We dea...