Sciweavers

151 search results - page 8 / 31
» Logical and algorithmic properties of stable conditional ind...
Sort
View
ASIACRYPT
2008
Springer
13 years 9 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
UAI
2004
13 years 9 months ago
Iterative Conditional Fitting for Gaussian Ancestral Graph Models
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
Mathias Drton, Thomas S. Richardson
TSP
2010
13 years 2 months ago
Algorithms for Complex ML ICA and Their Stability Analysis Using Wirtinger Calculus
Abstract--We derive a class of algorithms for independent component analysis (ICA) based on maximum likelihood (ML) estimation and perform stability analysis of natural gradient ML...
Hualiang Li, Tülay Adali
HASE
1997
IEEE
13 years 12 months ago
Automated Computation of Decomposable Synchronization Conditions
: The most important aspect of concurrent and distributed computation is the interaction between system components. Integration of components into a system requires some synchroniz...
Gilberto Matos, James M. Purtilo, Elizabeth L. Whi...
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 8 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...