Sciweavers

1985 search results - page 20 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Application specific loss minimization using gradient boosting
Gradient boosting is a flexible machine learning technique that produces accurate predictions by combining many weak learners. In this work, we investigate its use in two applica...
Bin Zhang, Abhinav Sethy, Tara N. Sainath, Bhuvana...
ICASSP
2011
IEEE
14 years 7 months ago
Proportionate-type normalized least mean square algorithm with gain allocation motivated by minimization of mean-square-weight d
In previous work, a water-filling algorithm was proposed which sought to minimize the mean square error (MSE) at any given time by optimally choosing the gains (i.e. step-sizes) ...
Kevin T. Wagner, Milos Doroslovacki
DAC
1996
ACM
15 years 7 months ago
Efficient Approximation Algorithms for Floorplan Area Minimization
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
Danny Z. Chen, Xiaobo Hu
FCCM
2007
IEEE
129views VLSI» more  FCCM 2007»
15 years 9 months ago
Automatic On-chip Memory Minimization for Data Reuse
FPGA-based computing engines have become a promising option for the implementation of computationally intensive applications due to high flexibility and parallelism. However, one...
Qiang Liu, George A. Constantinides, Konstantinos ...
JUCS
2002
179views more  JUCS 2002»
15 years 2 months ago
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
Bruce W. Watson