49 search results - page 1 / 10 » Graded Computation Tree Logic with Binary Coding |
CSL
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
75
Voted
CADE
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
ICIP
2001
IEEE
15 years 11 months ago
2001
IEEE
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
109
click to vote
IJON
2006
14 years 9 months ago
2006
Associative memory in cortical circuits has been held as a major mechanism for content-addressable memory. Hebbian synapses implement associative memory efficiently when storing s...
ICFEM
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...