2526 search results - page 294 / 506 » A New Algorithm for Answer Set Computation |
156
click to vote
ECCV
1996
Springer
16 years 8 months ago
1996
Springer
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
171
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
178
click to vote
ICPP
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
151
click to vote
ECCV
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. We address the problem of detecting human figures in images, taking into account that the image of the human figure may be taken from a range of viewpoints. We capture ...
198
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...