3096 search results - page 47 / 620 » The Generalized FITC Approximation |
167
click to vote
ICCAD
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
173
click to vote
SIAMSC
2008
15 years 5 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
128
click to vote
ISSAC
2004
Springer
15 years 11 months ago
2004
Springer
We give a necessary and sufficient condition for an algebraic ODE to have a rational type general solution. For an autonomous first order ODE, we give an algorithm to compute a r...
167
click to vote
PE
2006
Springer
15 years 6 months ago
2006
Springer
Approximating general distributions by phase-type (PH) distributions is a popular technique in stochastic analysis, since the Markovian property of PH distributions often allows a...
195
click to vote
ICC
2007
IEEE
16 years 10 days ago
2007
IEEE
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...