15073 search results - page 341 / 3015 » Probabilistic algorithms for computing resultants |
156
click to vote
QEST
2010
IEEE
15 years 2 months ago
2010
IEEE
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
141
click to vote
IJON
2010
14 years 11 months ago
2010
This paper presents a novel methodology to infer parameters of probabilistic models whose output noise is a Student-t distribution. The method is an extension of earlier work for ...
131
Voted
IVC
2006
15 years 4 months ago
2006
An exact analysis of the numerical errors being generated during the computation of the Zernike moments, by using the well-known `q-recursive' method, is attempted in this pa...
168
click to vote
AIPR
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we introduce real time image processing techniques using modern programmable Graphic Processing Units (GPU). GPUs are SIMD (Single Instruction, Multiple Data) device...
167
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...