Sciweavers

598 search results - page 17 / 120
» Predicting Lattice Reduction
Sort
View
CALC
2001
Springer
145views Cryptology» more  CALC 2001»
15 years 8 months ago
Fast Reduction of Ternary Quadratic Forms
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
Friedrich Eisenbrand, Günter Rote
148
Voted
JIPS
2010
107views more  JIPS 2010»
14 years 10 months ago
Incremental Model-based Test Suite Reduction with Formal Concept Analysis
Test scenarios can be derived based on some system models for requirements validation purposes. Model-based test suite reduction aims to provide a smaller set of test scenarios whi...
Pin Ng, Richard Y. K. Fung, Ray W. M. Kong
ANTS
1994
Springer
105views Algorithms» more  ANTS 1994»
15 years 8 months ago
A fast variant of the Gaussian reduction algorithm
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l1; l2; and l1;norm. The algorithm runs in at most O(n M(B) logB) bit op...
Michael Kaib
134
Voted
CDC
2009
IEEE
140views Control Systems» more  CDC 2009»
15 years 8 months ago
Model reduction, optimal prediction, and the Mori-Zwanzig representation of Markov chains
— Model reduction methods from diverse fields— including control, statistical mechanics and economics—aimed at systems that can be represented by Markov chains, are discusse...
Carolyn L. Beck, Sanjay Lall, Tzuchen Liang, Matth...
ICASSP
2009
IEEE
15 years 10 months ago
On the use of Bayesian modeling for predicting noise reduction performance
In speech enhancement applications, a validated metric of noise reduction performance is vital in the relative ranking of noise reduction algorithms and in enhancing the performan...
Nazanin Pourmand, David Suelzle, Vijay Parsa, Yi H...