3466 search results - page 55 / 694 » Fast computation of special resultants |
116
click to vote
AAECC
2008
Springer
15 years 24 days ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
118
Voted
DAC
1996
ACM
15 years 4 months ago
1996
ACM
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
121
Voted
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
We present a fast, effective and flexible tone reproduction method that preserves visibility and contrast impression of high dynamic range scenes in low dynamic range reproduction...
95
Voted
ICIP
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper proposes a fast blotch detection algorithm based on a Markov Random Field (MRF) model with less computational load and with lower false alarm rate than the existing MRF...
85
Voted
WDAG
2001
Springer
15 years 5 months ago
2001
Springer
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that cont...