656 search results - page 15 / 132 » Graph Theoretical Characterization and Computation of Answer... |
140
click to vote
MFCS
1998
Springer
15 years 8 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
152
click to vote
STACS
2012
Springer
13 years 12 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
176
click to vote
WLP
2007
Springer
15 years 10 months ago
2007
Springer
Answer-set programming (ASP) is an emerging logic-programming paradigm that strictly separates the description of a problem from its solving methods. Despite its semantic elegance,...
114
click to vote
WG
2001
Springer
15 years 8 months ago
2001
Springer
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
118
click to vote
ACCV
2010
Springer
14 years 11 months ago
2010
Springer
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...