1819 search results - page 127 / 364 » Computability and Representations of the Zero Set |
169
click to vote
SIP
2003
15 years 7 months ago
2003
We describe the establishment of a compound object model for object recognition purposes which provides the frame for the extraction of object structure from images degraded by no...
144
click to vote
AAAI
1997
15 years 7 months ago
1997
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
151
click to vote
ATVA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
164
click to vote
ICALP
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
172
click to vote
CAV
2005
Springer
15 years 12 months ago
2005
Springer
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...