Sciweavers

4940 search results - page 718 / 988
» On the Complexity of Universal Programs
Sort
View
ICASSP
2009
IEEE
16 years 1 months ago
Minimax design of adjustable FIR filters using 2D polynomial methods
The problem under study here is the minimax design of linearphase lowpass FIR filters having variable passband width and implemented through a Farrow structure. We have two main ...
Bogdan Dumitrescu, Bogdan C. Sicleru, Radu Stefan
TASE
2009
IEEE
16 years 1 months ago
The Logical Approach to Low-Level Stack Reasoning
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
Xinyu Jiang, Yu Guo, Yiyun Chen
ICECCS
2009
IEEE
106views Hardware» more  ICECCS 2009»
16 years 1 months ago
Visual Comparison of Graphical Models
Collaborative development, incremental design and revision management require the ability to compare different versions of software artifacts. There are well-established approache...
Arne Schipper, Hauke Fuhrmann, Reinhard von Hanxle...
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
16 years 1 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
16 years 1 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman