787 search results - page 64 / 158 » Polynomial Constants are Decidable |
ASPDAC
2009
ACM
14 years 2 months ago
2009
ACM
In this paper, we present a novel statistical full-chip leakage power analysis method. The new method can provide a general framework to derive the full-chip leakage current or po...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
COLT
1994
Springer
14 years 6 days ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...
UAI
2000
13 years 9 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...