1418 search results - page 15 / 284 » The Dynamic Complexity of Formal Languages |
120
click to vote
AGTIVE
2003
Springer
15 years 7 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
109
Voted
RR
2010
Springer
15 years 7 days ago
2010
Springer
The development and use of ontologies may require users with no training in formal logic to handle complex concept descriptions. To aid such users, we propose a new visualization f...
121
Voted
IFIP
2010
Springer
14 years 8 months ago
2010
Springer
The Trusted Platform Module (TPM) is a hardware chip designed to enable computers to achieve a greater level of security than is possible in software alone. To this end, the TPM pr...
216
click to vote
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
148
click to vote
JODS
2007
15 years 1 months ago
2007
Abstract. A viable ontology engineering methodology requires supporting domain experts in gradually building and managing increasingly complex versions of ontological elements and ...