Sciweavers

7264 search results - page 347 / 1453
» A multiplicative up-propagation algorithm
Sort
View
TMC
2010
224views more  TMC 2010»
15 years 5 months ago
Multihop Range-Free Localization in Anisotropic Wireless Sensor Networks: A Pattern-Driven Scheme
—This paper focuses on multihop range-free localization in anisotropic wireless sensor networks. In anisotropic networks, geometric distance between a pair of sensor nodes is not...
Qingjun Xiao, Bin Xiao, Jiannong Cao, Jianping Wan...
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
15 years 4 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
ANTS
1994
Springer
83views Algorithms» more  ANTS 1994»
15 years 10 months ago
On orders of optimal normal basis generators
In this paper we give some computational results on the multiplicative orders of optimal normal basis generators in F2n over F2 for n 1200 whenever the complete factorization of 2...
Shuhong Gao, Scott A. Vanstone
CORR
2006
Springer
83views Education» more  CORR 2006»
15 years 6 months ago
Fast linear algebra is stable
In [12] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be...
James Demmel, Ioana Dumitriu, Olga Holtz
ISSAC
2007
Springer
199views Mathematics» more  ISSAC 2007»
16 years 23 days ago
A sparse modular GCD algorithm for polynomials over algebraic function fields
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan