Sciweavers

136 search results - page 23 / 28
» Boolean Formulas and Frequent Sets
Sort
View
JAR
2006
101views more  JAR 2006»
14 years 9 months ago
Checking Consistency and Completeness of On-Line Product Manuals
Abstract. As products are growing more complex, so is their documentation. With an increasing number of product options, the diversity in service and maintenance procedures grows a...
Carsten Sinz, Wolfgang Küchlin, Dieter Feicht...
IJAR
2010
91views more  IJAR 2010»
14 years 8 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
82
Voted
ML
1998
ACM
131views Machine Learning» more  ML 1998»
14 years 9 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
ICWS
2008
IEEE
14 years 11 months ago
A Theory of Role Composition
We study the access control integration problem for web services. Organizations frequently use many services, each with its own access control policies, that must interoperate whi...
Jeffrey Fischer, Rupak Majumdar
ICALP
2005
Springer
15 years 3 months ago
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
Scott Diehl, Dieter van Melkebeek