4488 search results - page 647 / 898 » Properties of NP-Complete Sets |
191
Voted
ATVA
2007
Springer
16 years 7 days ago
2007
Springer
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...
139
click to vote
AUSDM
2007
Springer
16 years 7 days ago
2007
Springer
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
161
click to vote
CCS
2007
ACM
16 years 7 days ago
2007
ACM
Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. T...
139
click to vote
COCO
2007
Springer
16 years 6 days ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
167
click to vote
COLT
2007
Springer
16 years 6 days ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...