647 search results - page 97 / 130 » Generation of BDDs from hardware algorithm descriptions |
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper, we present a mathematical theory for Marr's primal sketch. We first conduct a theoretical study of the descriptive Markov random field model and the generative...
MOBIQUITOUS
2008
IEEE
14 years 2 months ago
2008
IEEE
Heterogeneous applications could be assimilated within the same wireless sensor network with the aid of modern motes that have multiple sensor boards on a single radio board. Diff...
DOCENG
2008
ACM
13 years 9 months ago
2008
ACM
Semantic web researchers tend to assume that XML Schema and OWL-S are the correct means for representing the types, structure, and semantics of XML data used for documents and int...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
The paper describes a model-based approach to developing a general tool for localizing faults in applications of data warehouse technology. A model of the application is configured...