15073 search results - page 316 / 3015 » Probabilistic algorithms for computing resultants |
150
click to vote
DCC
2007
IEEE
16 years 4 months ago
2007
IEEE
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
160
click to vote
TCS
2011
14 years 11 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
133
click to vote
ICCV
2001
IEEE
16 years 6 months ago
2001
IEEE
Several new algorithms for visual correspondence based on graph cuts [6, 13, 16] have recently been developed. While these methods give very strong results in practice, they do no...
166
click to vote
CVPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper describes an algorithm for pose and illumination invariant face recognition from a single image under occlusions. The method iteratively estimates the parameters of a 3...
118
click to vote
ICPP
2006
IEEE
15 years 10 months ago
2006
IEEE
Providing QoS guarantees to the applications in a multi-institutional Grid is a challenging task. Although advance reservations (ARs) can provide QoS guarantees for the applicatio...