Sciweavers

13 search results - page 1 / 3
» A numerical algorithm for zero counting, I: Complexity and a...
Sort
View
JC
2008
77views more  JC 2008»
13 years 4 months ago
A numerical algorithm for zero counting, I: Complexity and accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
13 years 10 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
CORR
2007
Springer
79views Education» more  CORR 2007»
13 years 4 months ago
Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additi...
Xuancheng Shao, Steven G. Johnson
CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 4 months ago
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and it...
Xuancheng Shao, Steven G. Johnson
PODS
2010
ACM
306views Database» more  PODS 2010»
13 years 10 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...