Sciweavers

46 search results - page 1 / 10
» A low complexity probabilistic test for integer multiplicati...
Sort
View
JC
2010
47views more  JC 2010»
13 years 7 months ago
A low complexity probabilistic test for integer multiplication
Dima Grigoriev, Gerald Tenenbaum
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 8 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
ATS
2005
IEEE
144views Hardware» more  ATS 2005»
14 years 2 months ago
On Detection of Resistive Bridging Defects by Low-Temperature and Low-Voltage Testing
—Test application at reduced power supply voltage (low-voltage testing) or reduced temperature (low-temperature testing) can improve the defect coverage of a test set, particular...
Sandip Kundu, Piet Engelke, Ilia Polian, Bernd Bec...
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 2 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
ICIP
2003
IEEE
14 years 10 months ago
Reversible integer KLT for progressive-to-lossless compression of multiple component images
In this paper, we presented a method for integer reversible implementation of KLT for multiple component image compression. The progressive-to-lossless compression algorithm emplo...
P. Hao, Q. Shi