Sciweavers

1282 search results - page 50 / 257
» Signing on signing off
Sort
View
CORR
2011
Springer
146views Education» more  CORR 2011»
13 years 4 months ago
Refined bounds on the number of connected components of sign conditions on a variety
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...
Sal Barone, Saugata Basu
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
13 years 4 months ago
A nested Krylov subspace method to compute the sign function of large complex matrices
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
Jacques Bloch, Simon Heybrock
ICASSP
2011
IEEE
13 years 25 days ago
Proportionate affine projection sign algorithms for sparse system identification in impulsive interference
Two proportionate af ne projection sign algorithms (APSAs) are proposed for system identi cation applications, such as network echo cancellation (NEC), where the impulse response ...
Zengli Yang, Yahong Rosa Zheng, Steven L. Grant
ARITH
1999
IEEE
14 years 1 months ago
Arithmetic with Signed Analog Digits
This paper presents mathematical foundtions of the Overlap Resolution Number System (ORNS) which employs signed Continuous Valued Digits (CVD's). ORNS is a redundant Number S...
Aryan Saed, Majid Ahmadi, Graham A. Jullien
JUCS
2007
117views more  JUCS 2007»
13 years 9 months ago
Connectivity and Reachability in Signed Networks
: For modeling real-life situations where not only the intensity of the relation existing between elements but also its polarity is important, we have proposed (see [Marcus and Tat...
Monica Tataram