7006 search results - page 563 / 1402 » Approximation Algorithms |
198
click to vote
CVPR
2000
IEEE
16 years 9 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
216
Voted
LATIN
2004
Springer
16 years 7 days ago
2004
Springer
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
177
click to vote
3DPVT
2002
IEEE
15 years 12 months ago
2002
IEEE
Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the Marchi...
292
click to vote
SIAMIS
2011
15 years 1 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
197
click to vote
DATESO
2007
15 years 8 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...