5624 search results - page 488 / 1125 » On Conditional Covering Problem |
217
click to vote
FOSSACS
2007
Springer
15 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
207
click to vote
ICFCA
2007
Springer
15 years 11 months ago
2007
Springer
Different rule semantics have been successively defined in many contexts such as implications in artificial intelligence, functional dependencies in databases or association rules...
157
click to vote
CSB
2004
IEEE
15 years 10 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
181
click to vote
CHES
2006
Springer
15 years 10 months ago
2006
Springer
In recent years, some countermeasures against Differential Power Analysis (DPA) at the logic level have been proposed. At CHES 2005 conference, Popp and Mangard proposed a new coun...
201
click to vote
CIVR
2006
Springer
15 years 10 months ago
2006
Springer
We propose a novel Bayesian learning framework of hierarchical mixture model by incorporating prior hierarchical knowledge into concept representations of multi-level concept struc...