681 search results - page 9 / 137 » General Polynomial Time Decomposition Algorithms |
94
Voted
ALT
2002
Springer
15 years 8 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
99
Voted
ERSHOV
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
114
click to vote
SECURWARE
2008
IEEE
15 years 6 months ago
2008
IEEE
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
DAC
2009
ACM
16 years 19 days ago
2009
ACM
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
113
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...