Sciweavers

5964 search results - page 1007 / 1193
» A theory of speculative computation
Sort
View
CORR
2011
Springer
151views Education» more  CORR 2011»
15 years 1 months ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 10 months ago
Probabilistic Logic: Many-valuedness and Intensionality
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
Zoran Majkic
COMPGEOM
2011
ACM
14 years 10 months ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...
GECCO
2011
Springer
232views Optimization» more  GECCO 2011»
14 years 10 months ago
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
ICSE
2011
IEEE-ACM
14 years 10 months ago
Inference of field initialization
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
Fausto Spoto, Michael D. Ernst
« Prev « First page 1007 / 1193 Last » Next »