Sciweavers

634 search results - page 1 / 127
» Groundwork for Weak Analysis
Sort
View
82
Voted
JSYML
2002
92views more  JSYML 2002»
14 years 9 months ago
Groundwork for Weak Analysis
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
António M. Fernandes, Fernando Ferreira
APLAS
2011
ACM
13 years 10 months ago
Soundness of Data Flow Analyses for Weak Memory Models
Modern multi-core microprocessors implement weak memory consistency models; programming for these architectures is a challenge. This paper solves a problem open for ten years, and ...
Jade Alglave, Daniel Kroening, John Lugton, Vincen...
MP
2011
14 years 29 days ago
Strong KKT conditions and weak sharp solutions in convex-composite optimization
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
Xi Yin Zheng, Kung Fu Ng
RSCTC
2000
Springer
111views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
Toward a Perception-Based Theory of Probabilistic Reasoning
The perception-based theory of probabilistic reasoning which is outlined in this paper is not in the traditional spirit. Its principal aim is to lay the groundwork for a radical e...
Lotfi A. Zadeh
CHES
2011
Springer
254views Cryptology» more  CHES 2011»
13 years 10 months ago
Extractors against Side-Channel Attacks: Weak or Strong?
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
Marcel Medwed, François-Xavier Standaert