199 search results - page 3 / 40 » On some Algorithmic Problems for Groups and Monoids |
ICCV
2009
IEEE
14 years 11 months ago
2009
IEEE
We present a novel variant of the RANSAC algorithm
that is much more efficient, in particular when dealing with
problems with low inlier ratios. Our algorithm assumes
that there...
FSTTCS
2003
Springer
13 years 11 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
CEC
2005
IEEE
14 years 9 hour ago
2005
IEEE
We study a selected group of hybrid EAs for solving CSPs, consisting of the best performing EAs from the literature. We investigate the contribution of the evolutionary component t...
DCC
2001
IEEE
14 years 6 months ago
2001
IEEE
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
ICDCS
2005
IEEE
13 years 12 months ago
2005
IEEE
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critica...