3454 search results - page 280 / 691 » Modern computer algebra |
162
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
186
click to vote
SIAMSC
2010
15 years 5 months ago
2010
Abstract. A smoothed aggregation multigrid method is presented for the numerical calculation of the stationary probability vector of an irreducible sparse Markov chain. It is shown...
183
click to vote
DLT
2009
15 years 4 months ago
2009
A famous theorem of Kuratowski states that, in a topological space, at most 14 distinct sets can be produced by repeatedly applying the operations of closure and complement to a gi...
230
click to vote
CVPR
2011
IEEE
15 years 1 days ago
2011
IEEE
We propose a reduced algebraic cost based on pairwise epipolar constraints for the iterative refinement of a multiple view 3D reconstruction. The aim is to accelerate the intermedi...
261
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...