793 search results - page 65 / 159 » Efficient computation of the characteristic polynomial |
DIS
2003
Springer
14 years 28 days ago
2003
Springer
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
A spatially adaptive image deblurring algorithm is presented for Poisson observations. It adapts to the unknown image smoothness by using local polynomial approximation (LPA) kern...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
ICLP
1997
Springer
13 years 12 months ago
1997
Springer
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...