Sciweavers

174 search results - page 30 / 35
» Permutation Groups in NC
Sort
View
CADE
2002
Springer
16 years 6 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg
ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
16 years 16 days ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
ISCAS
2008
IEEE
100views Hardware» more  ISCAS 2008»
16 years 12 days ago
On the security of a class of image encryption schemes
— Recently four chaos-based image encryption schemes were proposed. Essentially, the four schemes can be classified into one class, which is composed of two basic parts: permuta...
Chengqing Li, Guanrong Chen
ICDE
2007
IEEE
169views Database» more  ICDE 2007»
16 years 9 days ago
Aggregate Query Answering on Anonymized Tables
Privacy is a serious concern when microdata need to be released for ad hoc analyses. The privacy goals of existing privacy protection approaches (e.g., -anonymity and -diversity) ...
Qing Zhang, Nick Koudas, Divesh Srivastava, Ting Y...
ICA
2007
Springer
16 years 4 days ago
Pivot Selection Strategies in Jacobi Joint Block-Diagonalization
A common problem in independent component analysis after prewhitening is to optimize some contrast on the orthogonal or unitary group. A popular approach is to optimize the contras...
Cédric Févotte, Fabian J. Theis