Sciweavers

3466 search results - page 187 / 694
» Fast computation of special resultants
Sort
View
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 6 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
ICA
2004
Springer
16 years 8 min ago
Blind Deconvolution Using the Relative Newton Method
We propose a relative optimization framework for quasi maximum likelihood blind deconvolution and the relative Newton method as its particular instance. Special Hessian structure a...
Alexander M. Bronstein, Michael M. Bronstein, Mich...
TNN
2008
171views more  TNN 2008»
15 years 6 months ago
Adaptive Dynamic Inversion via Time-Scale Separation
Abstract--This paper presents a full state feedback adaptive dynamic inversion method for uncertain systems that depend nonlinearly upon the control input. Using a specialized set ...
Naira Hovakimyan, E. Lavretsky, Chengyu Cao
ICASSP
2011
IEEE
14 years 10 months ago
Efficient lattice-reduction-aided MMSE decision-feedback equalization
Since optimum diversity behavior can be achieved, equalization based on lattice basis reduction is of special interest for transmission over MIMO channels. Although the per-symbol...
Robert F. H. Fischer
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 6 months ago
Termination Detection of Local Computations
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
Emmanuel Godard, Yves Métivier, Gerard Tel