Sciweavers

4401 search results - page 530 / 881
» Computing with Default Logic
Sort
View
APAL
2007
104views more  APAL 2007»
15 years 7 months ago
Non-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
Benno van den Berg, Federico De Marchi
ENTCS
2008
98views more  ENTCS 2008»
15 years 6 months ago
Modal Expressiveness of Graph Properties
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
Mario R. F. Benevides, L. Menasché Schechte...
COLING
2006
15 years 6 months ago
Geometry and Meaning
and logic defined on certain types of abstract spaces and how that intimate relationship might be exploited when applied in computational linguistics. It is also about an approach ...
C. J. van Rijsbergen
CORR
2006
Springer
126views Education» more  CORR 2006»
15 years 6 months ago
Belief Calculus
This paper describes a method for risk analysis based on the approach used in CRAMM, but instead of using discrete measures for threats and vulnerabilities and lookup tables to de...
Audun Jøsang
JUCS
2007
102views more  JUCS 2007»
15 years 6 months ago
The Use of Runtime Reconfiguration on FPGA Circuits to Increase the Performance of the AES Algorithm Implementation
: This article presents an architecture that encrypts data with the AES algorithm. This architecture can be implemented on the Xilinx Virtex II FPGA family, by applying pipelining ...
Oscar Pérez, Yves Berviller, Camel Tanougas...