Sciweavers

2969 search results - page 8 / 594
» A space efficient algorithm for group structure computation
Sort
View
ISSAC
2000
Springer
94views Mathematics» more  ISSAC 2000»
15 years 1 months ago
Computing normalizers of permutation groups efficiently using isomorphisms of association schemes
This note presents an algorithm to speed up the computation of normalizers of permutation groups. It is an application of computation of isomorphisms of association schemes. Categ...
Izumi Miyamoto
ICPR
2004
IEEE
15 years 10 months ago
Perceptual Grouping for Contour Extraction
This paper describes an algorithm that efficiently groups line segments into perceptually salient contours in complex images. A measure of affinity between pairs of lines is used ...
Francisco J. Estrada, Allan D. Jepson
ICCV
2009
IEEE
16 years 2 months ago
GroupSAC: Efficient Consensus in the Presence of Groupings
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...
Kai Ni, Hailin Jin, Frank Dellaert
GECCO
2000
Springer
127views Optimization» more  GECCO 2000»
15 years 1 months ago
Evolving Molecules for Drug Design Using Genetic Algorithms via Molecular Trees
We present a new representation for a genetic algorithm to evolve molecular structures representing possible drugs that bind to a given protein target receptor. Our representation...
Gerard Kian-Meng Goh, James A. Foster