Sciweavers

2286 search results - page 23 / 458
» Algorithms for Categorical Equivalence
Sort
View
GECCO
2004
Springer
14 years 26 days ago
How to Overcome the Equivalent Mutant Problem and Achieve Tailored Selective Mutation Using Co-evolution
The use of Genetic Algorithms in evolution of mutants and test cases offers new possibilities in addressing some of the main problems of mutation testing. Most specifically the p...
Konstantinos Adamopoulos, Mark Harman, Robert M. H...
EWIMT
2004
13 years 9 months ago
Fuzzy Clustering with Pairwise Constraints for Knowledge-Driven Image Categorization
The identification of categories in image databases usually relies on clustering algorithms that only exploit the feature-based similarities between images. The addition of semant...
Nizar Grira, Michel Crucianu, Nozha Boujemaa
CONCUR
1991
Springer
13 years 11 months ago
A Tool Set for deciding Behavioral Equivalences
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to effi...
Jean-Claude Fernandez, Laurent Mounier
ICDE
2011
IEEE
253views Database» more  ICDE 2011»
12 years 11 months ago
Preventing equivalence attacks in updated, anonymized data
—In comparison to the extensive body of existing work considering publish-once, static anonymization, dynamic anonymization is less well studied. Previous work, most notably
Yeye He, Siddharth Barman, Jeffrey F. Naughton
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
14 years 1 months ago
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
Noboru Kunihiro, Kaoru Kurosawa