Sciweavers

5153 search results - page 555 / 1031
» Introduction to Randomized Algorithms
Sort
View
ISSAC
2004
Springer
106views Mathematics» more  ISSAC 2004»
15 years 12 months ago
Factoring polynomials via polytopes
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder
NAA
2004
Springer
178views Mathematics» more  NAA 2004»
15 years 12 months ago
Performance Optimization and Evaluation for Linear Codes
In this paper, we develop a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrice...
Pavel Tvrdík, Ivan Simecek
SETA
2004
Springer
126views Mathematics» more  SETA 2004»
15 years 12 months ago
Algebraic Feedback Shift Registers Based on Function Fields
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations o...
Andrew Klapper
ISVLSI
2003
IEEE
118views VLSI» more  ISVLSI 2003»
15 years 11 months ago
Networks-On-Chip: The Quest for On-Chip Fault-Tolerant Communication
In this paper, we discuss the possibility of achieving onchip fault-tolerant communication based on a new communication paradigm called stochastic communication. Specifically, for...
Radu Marculescu
ISCIS
2003
Springer
15 years 11 months ago
A New Continuous Action-Set Learning Automaton for Function Optimization
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorr...
Hamid Beigy, Mohammad Reza Meybodi