3454 search results - page 400 / 691 » Modern computer algebra |
163
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
165
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems and solved from a minimal number of image points. Finding ...
218
click to vote
COMGEO
2002
ACM
15 years 6 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
188
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...
175
click to vote
TKDE
2012
13 years 8 months ago
2012
—Computing interesting measures for data cubes and subsequent mining of interesting cube groups over massive datasets are critical for many important analyses done in the real wo...