Sciweavers

1717 search results - page 304 / 344
» A Computable Spectral Theorem
Sort
View
SIAMCOMP
2002
95views more  SIAMCOMP 2002»
15 years 3 days ago
Lower Bounds for Lucas Chains
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
Martin Kutz
ET
2010
89views more  ET 2010»
14 years 11 months ago
On the Duality of Probing and Fault Attacks
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
Berndt M. Gammel, Stefan Mangard
90
Voted
CORR
2011
Springer
127views Education» more  CORR 2011»
14 years 7 months ago
Is a probabilistic modeling
— A new standpoint on financial time series, without the use of any mathematical model and of probabilistic tools, yields not only a rigorous approach of trends and volatility, ...
Michel Fliess, Cédric Join, Fréd&eac...
INFOCOM
2011
IEEE
14 years 4 months ago
Spherical representation and polyhedron routing for load balancing in wireless sensor networks
—In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing ...
Xiaokang Yu, Xiaomeng Ban, Wei Zeng, Rik Sarkar, X...
139
Voted
CADE
2012
Springer
13 years 2 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...