Sciweavers

3466 search results - page 1 / 694
» Fast computation of special resultants
Sort
View
JSC
2006
76views more  JSC 2006»
13 years 11 months ago
Fast computation of special resultants
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
Alin Bostan, Philippe Flajolet, Bruno Salvy, &Eacu...
TIT
2002
82views more  TIT 2002»
13 years 10 months ago
Order estimation for a special class of hidden Markov sources and binary renewal processes
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...
Sanjeev Khudanpur, Prakash Narayan
INTERSPEECH
2010
13 years 5 months ago
The use of subvector quantization and discrete densities for fast GMM computation for speaker verification
Last year, we showed that the computation of a GMM-UBMbased speaker verification (SV) system may be sped up by 30 times by using a high-density discrete model (HDDM) on the NIST 2...
Guoli Ye, Brian Mak
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
14 years 3 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
ICDCS
1998
IEEE
14 years 3 months ago
Fast, Optimized Sun RPC Using Automatic Program Specialization
Fast remote procedure call (RPC) is a major concern for distributed systems. Many studies aimed at efficient RPC consist of either new implementations of the RPC paradigm or manua...
Gilles Muller, Renaud Marlet, Eugen-Nicolae Volans...