Sciweavers

3466 search results - page 19 / 694
» Fast computation of special resultants
Sort
View
JACM
2000
119views more  JACM 2000»
15 years 13 days ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 21 days ago
Capacity Results for Block-Stationary Gaussian Fading Channels with a Peak Power Constraint
Abstract--A peak-power-limited single-antenna block-stationary Gaussian fading channel is studied, where neither the transmitter nor the receiver knows the channel state informatio...
Jun Chen, Venugopal V. Veeravalli
110
Voted
ASPDAC
2010
ACM
151views Hardware» more  ASPDAC 2010»
14 years 10 months ago
Source-level timing annotation for fast and accurate TLM computation model generation
This paper proposes a source-level timing annotation method for generation of accurate transaction level models for software computation modules. While Transaction Level Modeling ...
Kai-Li Lin, Chen Kang Lo, Ren-Song Tsay
119
Voted
CIARP
2004
Springer
15 years 6 months ago
Refined Method for the Fast and Exact Computation of Moment Invariants
Geometric moments have been proven to be a very efficient tool for description and recognition of binary shapes. Numerous methods for effective calculation of image moments have be...
Juan Humberto Sossa Azuela, Jan Flusser
102
Voted
DAGSTUHL
2008
15 years 2 months ago
A Modified Staggered Correction Arithmetic with Enhanced Accuracy and Very Wide Exponent Range
Abstract. A so called staggered precision arithmetic is a special kind of a multiple precision arithmetic based on the underlying floating point data format (typically IEEE double ...
Frithjof Blomquist, Werner Hofschuster, Walter Kr&...