Sciweavers

6102 search results - page 395 / 1221
» Generating Optimizing Specializers
Sort
View
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
16 years 4 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
ICDE
2010
IEEE
189views Database» more  ICDE 2010»
16 years 3 months ago
I/O-Efficient Statistical Computing with RIOT
Statistical analysis of massive data is becoming indispensable to science, commerce, and society today. Such analysis requires efficient, flexible storage support and special optim...
Jun Yang 0001, Weiping Zhang, Yi Zhang
ARITH
2009
IEEE
15 years 11 months ago
Selected RNS Bases for Modular Multiplication
The selection of the elements of the bases in an RNS modular multiplication method is crucial and has a great impact in the overall performance. This work proposes specific sets ...
Jean-Claude Bajard, Marcelo E. Kaihara, Thomas Pla...
ICASSP
2009
IEEE
15 years 10 months ago
Generalized Baum-Welch algorithm for discriminative training on large vocabulary continuous speech recognition system
We propose a new optimization algorithm called Generalized Baum Welch (GBW) algorithm for discriminative training on hidden Markov model (HMM). GBW is based on Lagrange relaxation...
Roger Hsiao, Yik-Cheung Tam, Tanja Schultz
GLOBECOM
2008
IEEE
15 years 10 months ago
SINR Balancing for the Multi-User Downlink under General Power Constraints
Abstract—We address the problem of maximizing the minimum signal to interference and noise ratio of individual users via linear precoding in a multiuser downlink channel with mul...
Albrecht J. Fehske, Fred Richter, Gerhard Fettweis