Sciweavers

8768 search results - page 94 / 1754
» Generalizing the notion of support
Sort
View
WG
2005
Springer
16 years 10 days ago
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
Omer Giménez, Petr Hlinený, Marc Noy
STACS
2009
Springer
15 years 11 months ago
An Order on Sets of Tilings Corresponding to an Order on Languages
Abstract. Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings...
Nathalie Aubrun, Mathieu Sablik
LICS
1994
IEEE
15 years 11 months ago
Logical Bilattices and Inconsistent Data
The notion of a bilattice was rst proposed by Ginsberg as a general framework for many applications. This notion was further investigated and applied for various goals by Fitting....
Ofer Arieli, Arnon Avron
HYBRID
2004
Springer
16 years 7 days ago
Discrete and Hybrid Nonholonomy
In this paper we consider the generalization of the classical notion of nonholonomy of smooth constraints in analytical mechanics, to a substantially wider set of systems, allowing...
Antonio Bicchi, Alessia Marigo, Benedetto Piccoli
CCIA
2009
Springer
15 years 8 months ago
Secure and Optimal Base Contraction in Graded Lukasiewicz Logics
Abstract. The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Although, in the general case, thi...
Pere Pardo, Pilar Dellunde, Lluis Godo