224 search results - page 11 / 45 » Homogeneous Decomposition of Polynomials |
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
This paper introduces a robust adaptive patches sampling technique. The method does not rely on the use of keypoints to extract local information but all information contained in ...
CASC
2007
Springer
14 years 5 months ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
KDD
2001
ACM
14 years 11 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
IJAC
2006
13 years 11 months ago
2006
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
CONCUR
2006
Springer
14 years 2 months ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...