Sciweavers

793 search results - page 12 / 159
» Efficient computation of the characteristic polynomial
Sort
View
CORR
2008
Springer
82views Education» more  CORR 2008»
13 years 7 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 7 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
ICIP
2002
IEEE
14 years 9 months ago
Motion trajectory based video indexing and retrieval
This paper presents a technique to efficiently index and retrieve video clips in terms of motion-trajectory-based similarity. We describe the motion trajectory in three representa...
Chiou-Ting Hsu, Shang-Ju Teng
AISC
2008
Springer
13 years 9 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
14 years 1 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod