Sciweavers

1650 search results - page 58 / 330
» The HOM problem is decidable
Sort
View
IJAC
2007
59views more  IJAC 2007»
13 years 7 months ago
Automorphic Equivalence Problem for Free Associative Algebras of Rank Two
Let K x, y be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not tw...
Vesselin Drensky, Jie-Tai Yu
PAMI
2011
13 years 2 months ago
Applying Property Testing to an Image Partitioning Problem
—Property testing is a rapidly growing field of research. Typically, a property testing algorithm proceeds by quickly determining whether an input can satisfy some condition, und...
Igor Kleiner, Daniel Keren, Ilan Newman, Oren Ben-...
COMPGEOM
2011
ACM
12 years 11 months ago
Three problems about dynamic convex hulls
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
Timothy M. Chan
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
13 years 8 months ago
Accelerating convergence using rough sets theory for multi-objective optimization problems
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
Luis V. Santana-Quintero, Carlos A. Coello Coello
RTA
2009
Springer
14 years 2 months ago
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
Sergiu Bursuc, Hubert Comon-Lundh