Sciweavers

1989 search results - page 376 / 398
» Set functions for functional logic programming
Sort
View
LICS
2008
IEEE
14 years 2 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
FPGA
2005
ACM
215views FPGA» more  FPGA 2005»
14 years 1 months ago
Design, layout and verification of an FPGA using automated tools
Creating a new FPGA is a challenging undertaking because of the significant effort that must be spent on circuit design, layout and verification. It currently takes approximately ...
Ian Kuon, Aaron Egier, Jonathan Rose
PROFES
2004
Springer
14 years 29 days ago
Using a Reference Application with Design Patterns to Produce Industrial Software
Abstract. System architectures are described in abstract terms, often using Design Patterns. Actual reuse based on such descriptions requires that each development project derive a...
Marek Vokác, Oluf Jensen
SIGMOD
1999
ACM
99views Database» more  SIGMOD 1999»
13 years 12 months ago
Belief Reasoning in MLS Deductive Databases
It is envisaged that the application of the multilevel security (MLS) scheme will enhance exibility and e ectiveness of authorization policies in shared enterprise databases and w...
Hasan M. Jamil
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
14 years 9 months ago
Mining Views: Database Views for Data Mining
We present a system towards the integration of data mining into relational databases. To this end, a relational database model is proposed, based on the so called virtual mining vi...
Élisa Fromont, Adriana Prado, Bart Goethals...