Sciweavers

1278 search results - page 103 / 256
» The Complexity of Weighted Boolean
Sort
View
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
14 years 2 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
ICCAD
1997
IEEE
99views Hardware» more  ICCAD 1997»
14 years 2 months ago
High-level area and power estimation for VLSI circuits
High-level power estimation, when given only a high-level design specification such as a functional or RTL description, requires high-level estimation of the circuit average acti...
Mahadevamurty Nemani, Farid N. Najm
AI
1999
Springer
13 years 10 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...
VLDB
2007
ACM
95views Database» more  VLDB 2007»
14 years 10 months ago
Matching Twigs in Probabilistic XML
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
Benny Kimelfeld, Yehoshua Sagiv
ICCAD
1994
IEEE
137views Hardware» more  ICCAD 1994»
14 years 2 months ago
Dynamic scheduling and synchronization synthesis of concurrent digital systems under system-level constraints
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
Claudionor José Nunes Coelho Jr., Giovanni ...