Sciweavers

2517 search results - page 166 / 504
» Specifying Weak Sets
Sort
View
BMCBI
2007
141views more  BMCBI 2007»
15 years 6 months ago
HeliCis: a DNA motif discovery tool for colocalized motif pairs with periodic spacing
Background: Correct temporal and spatial gene expression during metazoan development relies on combinatorial interactions between different transcription factors. As a consequence...
Erik Larsson, Per Lindahl, Petter Mostad
ML
1998
ACM
15 years 6 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
SIAMCO
2002
71views more  SIAMCO 2002»
15 years 6 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
SACMAT
2009
ACM
16 years 1 months ago
Access control policy combining: theory meets practice
Many access control policy languages, e.g., XACML, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the result...
Ninghui Li, Qihua Wang, Wahbeh H. Qardaji, Elisa B...
ESOP
2005
Springer
16 years 1 days ago
Programming with Explicit Security Policies
Are computing systems trustworthy? To answer this, we need to know three things: what the systems are supposed to do, what they are not supposed to do, and what they actually do. A...
Andrew C. Myers