2983 search results - page 49 / 597 » The group marriage problem |
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
We consider the problem of learning a sparse multi-task regression, where the structure in the outputs can be represented as a tree with leaf nodes as outputs and internal nodes a...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Dynamic group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to work in a scenario in which the group membership is not known in advance but where parti...
CVPR
2005
IEEE
14 years 12 months ago
2005
IEEE
While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matr...