15073 search results - page 325 / 3015 » Probabilistic algorithms for computing resultants |
128
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
141
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper presents a novel spatio-temporal Markov random field (MRF) for video denoising. Two main issues are addressed in this paper, namely, the estimation of noise model and t...
163
click to vote
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract—Learning dynamical systems is one of the important problems in many fields. In this paper, we present an algorithm for learning non-linear dynamical systems which works...
111
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
—In social news services, selecting valuable and credible news content is one of the most important issues. In traditional journalism, a small number of people called editors sel...
128
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...